Abstract
A recursive MDS matrix is an MDS matrix which can be expressed as a power of some companion matrix. The advantage of such a matrix is that it can be implemented by a single LFSR clocking several times. Such matrices are suitable for the design of diffusion layer in lightweight cryptographic applications. It is known that there do not exist involutory recursive MDS matrices. It means that if a recursive MDS matrix M is considered for the diffusion layer in encryption then the diffusion layer process in both encryption and decryption (if \(M^{-1}\) needs to be computed) cannot be the same, requiring two different LFSR implementations. In this paper we look at some possibilities of making the implementation of the diffusion layer part in both encryption and decryption to use almost the same circuit (LFSR) by using some special recursive MDS matrices. The difference or the cost of the additional operations/control mechanism used is minimal. In this direction we first discuss two known structures: regular recursive MDS matrices, symmetric recursive MDS matrices. We then propose some other structures called almost involutory recursive MDS matrices which can use the same LFSR for realizing the diffusion layer part in both encryption and decryption. We then present a new method for the direct construction of recursive MDS matrices. Our method gives a new infinite class polynomials that yield recursive MDS matrices. We also present some experimental results and comparison results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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 (2015).
Barreto P., Rijmen V.: The Anubis Block Cipher. Submission to the NESSIE Project (2000).
Barreto P., Rijmen V.: The Khazad Legacy-Level Block Cipher. First Open NESSIE Workshop (2000).
Beierle C., Kranz T., Leander G.: Lightweight multiplication in \(GF(2^n)\) with applications to MDS matrices. In: CRYPTO 2016, LNCS, vol. 9814, pp. 625–653. Springer (2016).
Berger T.P.: Construction of recursive MDS diffusion layers from Gabidulin codes. In: INDOCRYPT 2013, LNCS, vol. 8250, pp. 274–285. Springer (2013).
Daemen J., Rijmen V.: The design of Rijndael: AES—the advanced encryption standard. In: Information Security and Cryptography. Springer (2002).
Guo J., Peyrin T., Poshmann A.: The PHOTON family of lightweight hash functions. In: CRYPTO 2011, LNCS, vol. 6841, pp. 222–239. Springer (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 (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 (2013).
Gupta K.C., Ray I.G.: On constructions of involutory MDS matrices. In: AFRICACRYPT, LNCS, vol. 7918, pp. 43–60. Springer (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. 82(1–2), 77–94 (2017).
Gupta K.C., Pandey S.K., Venkateswarlu A.: Towards a general construction of recursive MDS diffusion layers. Des. Codes Cryptogr. 82(1–2), 179–195 (2017).
Junod P., Vaudenay S.: Perfect diffusion primitives for block ciphers. In: SAC 2004, LNCS, vol. 3357, pp. 84–99. Springer (2004).
Khoo K., Peyrin T., Poschmann A., Yap H.: FOAM: searching for hardware-optimal SPN Structures and components with a fair comparison. In: CHES 2014, LNCS, vol. 8731, pp. 433–450. Springer (2014).
Kolokotronis N., Limniotis K., Kalouptsidis N.: Factorization of determinants over finite fields and application in stream ciphers. Cryptogr. Commun. 1, 175–205 (2009).
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 Publishing Co., New York (1977).
Nakahara J., Abraho E.: A new involutory MDS matrix for the AES. J Netw. Secur. 9(2), 109–116 (2009).
Rijmen V., Daemen J., Preneel B., Bosselaers A., De Win E.: The cipher SHARK. In: FSE 1996, LNCS, vol. 1039, pp. 99–111. Springer (1996).
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 (2012).
Sarkar S., Syed H., Sadhukhan R., Mukhopadhyay D.: Lightweight design choices for LED-like block ciphers. In: INDOCRYPT 2017, LNCS, vol. 10698, pp. 267–281. Springer (2017).
Sim S.M., Khoo K., Oggier F., Peyrin T.: Lightweight MDS involution matrices. In: FSE 2015, LNCS, vol. 9054, pp. 471–493. Springer (2015).
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 (2013).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
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. Almost involutory recursive MDS diffusion layers. Des. Codes Cryptogr. 87, 609–626 (2019). https://doi.org/10.1007/s10623-018-0582-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-018-0582-2