On Constructions of Circulant MDS Matrices for Lightweight Cryptography
Maximum distance separable (MDS) matrices have applica tions not only in coding theory but are also of great importance in the design of block ciphers and hash functions.It is highly nontrivial to find MDS matrices which could be used in lightweight cryptography.In this paper we study and construct efficient d × d circulant MDS matrices for d up to 8 and consider their inverses, which are essential for SPN networks.We explore some interesting and useful properties of circulant matrices which are prevalent in many parts of mathematics and computer sci ence.We prove that circulant MDS matrix can not be involutory.We also prove that 2d × 2d circulant matrix can not be both orthogonal and MDS.
Diffusion InvMixColumn operation Involutory matrix MDS matrix MixColumn operation Orthogonal matrix
Kishan Chand Gupta Indranil Ghosh Ray
Applied Statistics Unit,Indian Statistical Institute 203,B.T. Road,Kolkata 700108,India
国际会议
福州
英文
564-576
2014-05-05（万方平台首次上网日期，不代表论文的发表时间）