Abstract
Although linear perfect diffusion primitives, i.e. MDS matrices, are widely used in block ciphers, e.g. AES, very little systematic work has been done on how to find "efficient" ones. In this paper we attempt to do so by considering software implementations on various platforms. These considerations lead to interesting combinatorial problems: how to maximize the number of occurrences of 1 in those matrices, and how to minimize the number of pairwise different entries. We investigate these problems and construct efficient 4×4 and 8×8 MDS matrices to be used e.g. in block ciphers. © Springer-Verlag 2005.
Cite
CITATION STYLE
Junod, P., & Vaudenay, S. (2004). Perfect diffusion primitives for block ciphers building efficient MDS matrices. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3357, 84–99. https://doi.org/10.1007/978-3-540-30564-4_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
