Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications

被引:33
作者
Gupta, Kishan Chand [1 ]
Ray, Indranil Ghosh [1 ]
机构
[1] Indian Stat Inst, Appl Stat Unit, Kolkata 700108, India
来源
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES | 2015年 / 7卷 / 02期
关键词
Diffusion; InvMixColumn operation; Involutory matrix; MDS matrix; MixColumn operation; Orthogonal matrix;
D O I
10.1007/s12095-014-0116-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
MDS matrices incorporate diffusion layers in block ciphers and hash functions. MDS matrices are in general not sparse and have a large description and thus induce costly implementations both in hardware and software. It is also nontrivial to find MDS matrices which could be used in lightweight cryptography. In the AES MixColumn operation, a circulant MDS matrix is used which is efficient as its elements are of low hamming weights, but no general constructions and study of MDS matrices from d x d circulant matrices for arbitrary d is available in the literature. In a SAC 2004 paper, Junod et al. constructed a new class of efficient matrices whose submatrices were circulant matrices and they coined the term circulating-like matrices for these new class of matrices. We call these matrices as Type-I circulant-like matrices. In this paper we introduce a new type of circulant-like matrices which are involutory by construction and we call them Type-II circulant-like matrices. We study the MDS properties of d x d circulant, Type-I and Type-II circulant-like matrices and construct new and efficient MDS matrices which are suitable for lightweight cryptography for d up to 8. We also consider orthogonal and involutory properties of such matrices and study the construction of efficient MDS matrices whose inverses are also efficient. We explore some interesting and useful properties of circulant, Type-I and Type-II circulant-like matrices which are prevalent in many parts of mathematics and computer science.
引用
收藏
页码:257 / 287
页数:31
相关论文
共 37 条
[1]  
Augot D., 2014, FSE
[2]  
Barreto P.S.L.M., 2000, NESSIE Algorithm Submission
[3]  
Barreto P.S.L.M., 2000, KHAZAD LEGACY LEVEL
[4]  
Barreto PauloS. L. M., 2011, ENCY CRYPTOGRAPHY SE, DOI DOI 10.1007/978-1-4419-5906-5_626
[5]   The Magma algebra system .1. The user language [J].
Bosma, W ;
Cannon, J ;
Playoust, C .
JOURNAL OF SYMBOLIC COMPUTATION, 1997, 24 (3-4) :235-265
[6]  
Choy J., 2012, AFRICACRYPT 2012
[7]  
Daemen J, 1997, LECT NOTES COMPUT SC, V1267, P149
[8]  
Daemen J, 2002, Information Security and Cryptography
[9]  
Filho G. D., 2006, P 6 BRAZ S INF COMP
[10]  
Gauravaram P., 2008, GROSTL SHA 3 CANADIA