On the Construction of Lightweight Circulant Involutory MDS Matrices

被引:40
|
作者
Li, Yongqiang [1 ,2 ]
Wang, Mingsheng [1 ]
机构
[1] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing, Peoples R China
[2] Sci & Technol Commun Secur Lab, Chengdu, Sichuan, Peoples R China
来源
基金
美国国家科学基金会;
关键词
MDS matrix; Circulant involutory matrix; Hadamard matrix; Lightweight;
D O I
10.1007/978-3-662-52993-5_7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the present paper, we investigate the problem of constructing MDS matrices with as few bit XOR operations as possible. The key contribution of the present paper is constructing MDS matrices with entries in the set of m x m non-singular matrices over F-2 directly, and the linear transformations we used to construct MDS matrices are not assumed pairwise commutative. With this method, it is shown that circulant involutory MDS matrices, which have been proved do not exist over the finite field F(2)m, can be constructed by using non-commutative entries. Some constructions of 4 x 4 and 5 x 5 circulant involutory MDS matrices are given when m = 4, 8. To the best of our knowledge, it is the first time that circulant involutory MDS matrices have been constructed. Furthermore, some lower bounds on XORs that required to evaluate one row of circulant and Hadamard MDS matrices of order 4 are given when m = 4, 8. Some constructions achieving the bound are also given, which have fewer XORs than previous constructions.
引用
收藏
页码:121 / 139
页数:19
相关论文
共 50 条
  • [41] On the construction of near-MDS matrices
    Kishan Chand Gupta
    Sumit Kumar Pandey
    Susanta Samanta
    Cryptography and Communications, 2024, 16 : 249 - 283
  • [42] On the construction of near-MDS matrices
    Gupta, Kishan Chand
    Pandey, Sumit Kumar
    Samanta, Susanta
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2024, 16 (02): : 249 - 283
  • [43] Construction of New Hadamard Matrix Forms to Generate 4x4 and 8x8 Involutory MDS Matrices Over GF(2m) for Lightweight Cryptography
    Kumar, Yogesh
    Mishra, P. R.
    Gaur, Atul
    Mittal, Gaurav
    DEFENCE SCIENCE JOURNAL, 2024, 74 (01) : 68 - 78
  • [44] COMMENTS ON INVOLUTORY MATRICES
    HODGES, JH
    AMERICAN MATHEMATICAL MONTHLY, 1966, 73 (08): : 864 - &
  • [45] Lightweight Recursive MDS Matrices with Generalized Feistel Network
    Li, Qiuping
    Wu, Baofeng
    Liu, Zhuojun
    ADVANCES IN INFORMATION AND COMPUTER SECURITY, IWSEC 2018, 2018, 11049 : 262 - 278
  • [46] APPLICATION OF CIRCULANT MATRICES TO THE CONSTRUCTION AND DECODING OF LINEAR CODES
    ROTH, RM
    LEMPEL, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (05) : 1157 - 1163
  • [47] Construction of LDPC codes based on circulant permutation matrices
    Qiao, Hua
    Guan, Wu
    Dong, Ming-Ke
    Xiang, Hai-Ge
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2008, 30 (10): : 2384 - 2387
  • [48] A note on semi-orthogonal (G-matrix) and semi-involutory MDS matrices
    Chatterjee, Tapas
    Laha, Ayantika
    FINITE FIELDS AND THEIR APPLICATIONS, 2023, 92
  • [49] XOR count and block circulant MDS matrices over finite commutative rings
    Ali, Shakir
    Alali, Amal S.
    Khan, Atif Ahmad
    Wijayanti, Indah Emilia
    Wong, Kok Bin
    AIMS MATHEMATICS, 2024, 9 (11): : 30529 - 30547
  • [50] Applying Horner's Rule to Optimize Lightweight MDS Matrices
    Bai, Jian
    Sun, Yao
    Li, Ting
    Wang, Dingkang
    INTERNATIONAL JOURNAL OF DIGITAL CRIME AND FORENSICS, 2019, 11 (04) : 82 - 96