On Constructions of a Sort of MDS Block Diffusion Matrices for Block Ciphers and Hash Functions

Many modern block ciphers use maximum distance separate (MDS) matrices as their diffusion layers. In this paper, we propose a new method to verify a sort of MDS diffusion block matrices whose blocks are all polynomials in a certain primitive block over the finite field F2. And then we discover a new kind of transformations that can retain MDS property of diffusion matrices and generate a series of new MDS matrices from a given one. Moreover, we get an equivalence relation from this kind of transformation. And MDS property is an invariant with respect to this equivalence relation which can greatly reduce the amount of computation when we search for MDS matrices. The minimal polynomials of matrices play an important role in our strategy. To avoid being too theoretical, we list a series of MDS diffusion matrices obtained from our method for some specific parameters. Furthermore, we talk about MDS recursive diffusion layers with our method and extend the corresponding work of M. Sajadieh et al. published on FSE 2012 and the work of S. Wu published on SAC 2012.

[1]  Mahdi Sajadieh,et al.  Recursive Diffusion Layers for Block Ciphers and Hash Functions , 2012, FSE.

[2]  Serge Vaudenay,et al.  Links Between Differential and Linear Cryptanalysis , 1994, EUROCRYPT.

[3]  Wenling Wu,et al.  Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions , 2012, Selected Areas in Cryptography.

[4]  Jérôme Lacan,et al.  Systematic MDS erasure codes based on Vandermonde matrices , 2004, IEEE Communications Letters.

[5]  Kishan Chand Gupta,et al.  On Constructions of Involutory MDS Matrices , 2013, AFRICACRYPT.

[6]  Rudolf Lide,et al.  Finite fields , 1983 .

[7]  Jorge Nakahara,et al.  A New Involutory MDS Matrix for the AES , 2009, Int. J. Netw. Secur..

[8]  Mario Blaum,et al.  On Lowest Density MDS Codes , 1999, IEEE Trans. Inf. Theory.

[9]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[10]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[11]  Vincent Rijmen,et al.  The Design of Rijndael: AES - The Advanced Encryption Standard , 2002 .

[12]  Daniel Augot,et al.  Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes , 2014, FSE.

[13]  Chaoping Xing,et al.  Coding Theory: A First Course , 2004 .

[14]  Christof Paar,et al.  Block Ciphers - Focus on the Linear Layer (feat. PRIDE) , 2014, CRYPTO.

[15]  Thierry P. Berger,et al.  Construction of Recursive MDS Diffusion Layers from Gabidulin Codes , 2013, INDOCRYPT.

[16]  D. Serre.  Matrices: Theory and Applications , 2002 .

[17]  J. Rotman.  Advanced Modern Algebra , 2002 .

[18]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[19]  Mitsuru Matsui,et al.  Linear Cryptanalysis Method for DES Cipher , 1994, EUROCRYPT.

[20]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[21]  H. Niederreiter,et al.  Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .

[22]  Kishan Chand Gupta,et al.  On Constructions of MDS Matrices from Companion Matrices for Lightweight Cryptography , 2013, IACR Cryptol. ePrint Arch..

[23]  A. Youssef.  On the Design of Linear Transformations for Substitution Permutation Encryption Networks , 2007 .

[24]  Eli Biham,et al.  Differential cryptanalysis of DES-like cryptosystems , 1990, Journal of Cryptology.

[25]  Mahdi Sajadieh,et al.  On construction of involutory MDS matrices from Vandermonde Matrices in GF(2q) , 2011, Designs, Codes and Cryptography.

[26]  Thomas Peyrin,et al.  The PHOTON Family of Lightweight Hash Functions , 2011, IACR Cryptol. ePrint Arch..