Abstract
MDS matrices are of great importance in the design of block ciphers and hash functions. MDS matrices are not sparse and have a large description and thus induce costly implementation in software/hardware. To overcome this problem, in particular for applications in light-weight cryptography, it was proposed by Guo et al. to use recursive MDS matrices. A recursive MDS matrix is an MDS matrix which can be expressed as a power of some companion matrix. Following the work of Guo et al., some ad-hoc search techniques are proposed to find recursive MDS matrices which are suitable for hardware/software implementation. In another direction, coding theoretic techniques are used to directly construct recursive MDS matrices: Berger technique uses Gabidulin codes and Augot et al. technique uses shortened BCH codes. In this paper, we first characterize the polynomials that yield recursive MDS matrices in a more general setting. Based on this we provide three methods for obtaining such polynomials. Moreover, the recursive MDS matrices obtained using shortened BCH codes can also be obtained with our first method. In fact we get a larger set of polynomials than the method which uses shortened BCH codes. Our other methods appear similar to the method which uses Gabidulin codes. We get a new infinite class of recursive MDS matrices from one of the proposed methods. Although we propose three methods for the direct construction of recursive MDS matrices, our characterization results pave the way for new direct constructions.
Similar content being viewed by others
References
Augot D., Finiasz M.: Exhaustive search for small dimension recursive MDS diffusion layers or block ciphers and hash functions. In: Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 1551–1555 (2013).
Augot D., Finiasz M.: Direct construction of recursive MDS diffusion layers using shortened BCH Codes. In: FSE 2014. LNCS, vol. 8540, pp. 3–17, Springer, New York (2015). Also available http://eprint.iacr.org/2014/566.
Berger T.P.: Construction of recursive MDS diffusion layers from Gabidulin codes. In: INDOCRYPT 2013. LNCS, vol. 8250, pp. 274–285. Springer, New York (2013).
Berger T.P., Ourivski A.: Construction of new MDS codes from Gabidulin codes. In: Proceedings of ACCT 2009, Kranevo, Bulgaria, pp. 40–47 (2004).
Castagnoli G., Massey J.L., Schoeller P.A., von Seeman N.: On repeated-root cyclic codes. IEEE Trans. Inf. Theory 37(2), 337–342 (1991).
Daemen J., Rijmen V.: The design of Rijndael: AES—the advanced encryption standard. In: Information Security and Cryptography. Springer, New York (2002).
Guo J., Peyrin T., Poshmann A.: The PHOTON family of lightweight hash functions. In: CRYPTO 2011. LNCS, vol. 6841, pp. 222–239. Springer, New York (2011).
Guo J., Peyrin T., Poshmann A., Robshaw M.J.B.: The LED block cipher. In: CHES 2011. LNCS, vol. 6917, pp. 326–341. Springer, New York (2011).
Gupta K.C., Ray I.G.: On constructions of MDS matrices from companion matrices for lightweight cryptography. In: CD-ARES Workshops 2013. LNCS, vol. 8128, pp. 29–43. Springer, New York (2013).
Gupta K.C., Ray I.G.: Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications. Cryptogr. Commun. 7(2), 257–287 (2015).
Gupta K.C., Pandey S.K., Venkateswarlu A.: On the direct construction of recursive MDS matrices. Des. Codes Cryptogr. (2016). doi:10.1007/s10623-016-0233-4.
Junod P., Vaudenay S.: Perfect diffusion primitives for block ciphers. In: SAC 2004. LNCS, vol. 3357, pp. 84–99. Springer, New York (2004).
Junod P., Vaudenay S.: FOX: A new family of block ciphers. In: SAC 2004. LNCS, vol. 3357, pp. 114–129. Springer, New York (2004).
Lidl R., Niederreiter H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997).
MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977).
Sajadieh M., Dakhilalian M., Mala H., Sepehrdad P.: Recursive diffusion layers for block ciphers and hash functions. In: FSE 2012. LNCS, vol. 7549, pp. 385–401. Springer, New York (2012).
Schnorr C.P., Vaudenay S.: Black box cryptanalysis of hash networks based on multipermutations. In: EUROCRYPT 1994. LNCS, vol. 950, pp. 47–57. Springer, New York (1995).
Shannon C.E.: Communication Theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949).
Vaudenay S.: On the need for multipermutations: cryptanalysis of MD4 and SAFER. In: Fast Software Encryption 1994. LNCS, vol. 1008, pp. 286–297. Springer, New York (1995).
Wu S., Wang M., Wu W.: Recursive diffusion layers for (lightweight) block ciphers and hash functions. In: SAC 2013. LNCS, vol. 7707, pp. 355–371. Springer, New York (2013).
Acknowledgments
We thank the anonymous reviewers for their valuable comments. Major part of the work was done when the second author was at C. R. Rao AIMSCS, Hyderabad, India.
Author information
Authors and Affiliations
Corresponding author
Additional information
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography”.
Rights and permissions
About this article
Cite this article
Gupta, K.C., Pandey, S.K. & Venkateswarlu, A. Towards a general construction of recursive MDS diffusion layers. Des. Codes Cryptogr. 82, 179–195 (2017). https://doi.org/10.1007/s10623-016-0261-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-016-0261-0
Keywords
- Diffusion layer
- MDS codes
- Recursive MDS matrices
- Companion matrices
- Cyclic codes
- BCH codes
- Gabidulin codes