Paper 2017/368 Original: eprint.iacr.org/2017/368 ↗
Analysis of Toeplitz MDS Matrices
Abstract
This work considers the problem of constructing efficient MDS matrices over the field $\F_{2^m}$. Efficiency is measured by the metric XOR count which was introduced by Khoo et al. in CHES 2014. Recently Sarkar and Syed (ToSC Vol. 1, 2016) have shown the existence of $4\times 4$ Toeplitz MDS matrices with optimal XOR counts. In this paper, we present some characterizations of Toeplitz matrices in light of MDS property. Our study leads to improving the known bounds of XOR counts of $8\times 8$ MDS matrices by obtaining Toeplitz MDS matrices with lower XOR counts over $\F_{2^4}$ and $\F_{2^8}$.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2017-04-28: last updated
- 2017-04-28: published
- Short URL
- https://ia.cr/2017/368
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2017/368,
author = {Sumanta Sarkar and Habeeb Syed},
title = {Analysis of Toeplitz MDS Matrices},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/368},
year = {2017},
url = {https://eprint.iacr.org/2017/368}
}