Perfect Diffusion Primitives for Block Ciphers ? Building Efficient MDS Matrices

  title={Perfect Diffusion Primitives for Block Ciphers ? Building Efficient MDS Matrices},
  author={Pascal Junod and Serge Vaudenay},
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… CONTINUE READING
Highly Cited
This paper has 75 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.
Showing 1-10 of 27 extracted citations

On Compact Cauchy Matrices for Substitution-Permutation Networks

IEEE Transactions on Computers • 2015
View 6 Excerpts
Highly Influenced

Lai-Massey Cipher Designs

Springer International Publishing • 2018

75 Citations

Citations per Year
Semantic Scholar estimates that this publication has 75 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-9 of 9 references

FOX : A New Family of Block Ciphers

Selected Areas in Cryptography • 2004
View 6 Excerpts
Highly Influenced

The Design of Rijndael

Information Security and Cryptography • 2002
View 5 Excerpts
Highly Influenced

The Twofish encryption algorithm

B. Schneier, J. Kelsey, +3 authors N. Ferguson
Wiley, • 1999

The theory of error-correcting codes

F. MacWilliams, N. Sloane
NorthHolland, • 1977

Communication theory of secrecy systems

C. Shannon
Bell System Technical Journal, 28(4), • 1949
View 1 Excerpt