On the direct building of 8 × 8 self-reciprocal recursive MDS Matrices effective for implementation over GF(q) using Reed-Solomon codes
*Tran Thi LuongCorresponding authorluongtranhong@gmail.comNo. 141 Chien Thang road, Tan Trieu, Thanh TriAcademy of Cryptography TechniquesHanoi, VietnamView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Jun 2022
- Published Online:
- 21 Aug 2023
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-1715
- Pages:
- 1237–1248
Abstract
Keywords
Subject Classifications
References
[1] Augot D. and Finiasz M., “Exhaustive search for small dimension recursive mds diffusion layers for block ciphers and hash functions,” in 2013 IEEE International Symposium on Information Theory Proceedings (ISIT). IEEE, 2013, pp.1551-1555.
[2] 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).
[3] 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).
[4] 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).
[5] Gupta K.C., Pandey S.K., Venkateswarlu A., Almost involutory recursive MDS diffusion layers, Design, Codes and Cryptography, 87 (2018), 609-626.
[6] Kolay S., Mukhopadhyay D., “Lightweight diffusion layer from the kth root of the mds matrix”, IACR Cryptology ePrint Archive, vol. 498, 2014.
[7] Luong T. T., “Constructing effectively MDS and recursive MDS atrices by Reed-Solomon codes”, Journal of Science and Technology on Information Security of Viet Nam Government Information Security Commission, vol.3, no. 2, pp. 10–16, 2016.
[8] Luong T. T., Cuong N. N., and Trinh B. D., 4 × 4 Recursive MDS Matrices Effective for Implementation from Reed-Solomon Code over GF(q) Field. International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences – MCO 2021, pp 386-391, 2021.
[9] MacWiliams F.J, Sloan N.J. The Theory of Error-Correcting Codes, North-holland Publishing Company Amsterdam-New York- Oxford, Third Printing, 1981.
[10] 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).
[11] Vaudenay S., On the need for multipermutations: cryptanalysis of MD4 and SAFER. In B. Preneel, editor, Fast Software Encryption. Proceedings, volume 1008 of LNCS, pages 286–297. Springer-Verlag, 1995.
[12] 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).
