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 条
  • [31] Lightweight MDS Involution Matrices
    Sim, Siang Meng
    Khoo, Khoongming
    Oggier, Frederique
    Peyrin, Thomas
    FAST SOFTWARE ENCRYPTION, FSE 2015, 2015, 9054 : 471 - 493
  • [32] Construction of 4 x 4 MDS Matrices for Lightweight Block Ciphers
    Tiwari, Vikas
    Naidu, Allu Swamy
    Singh, Ajeet
    Saxena, Ashutosh
    2021 IEEE INTERNATIONAL CONFERENCE ON ADVANCED NETWORKS AND TELECOMMUNICATIONS SYSTEMS (IEEE ANTS), 2021,
  • [33] Genetic Algorithm-Based Method for Discovering Involutory MDS Matrices
    Bellfkih, El Mehdi
    Nouh, Said
    Chems Eddine Idrissi, Imrane
    Louartiti, Khalid
    Mouline, Jamal
    COMPUTATIONAL AND MATHEMATICAL METHODS, 2023, 2023
  • [34] On Efficient Constructions of Lightweight MDS Matrices
    Zhou, Lijing
    Wang, Licheng
    Sun, Yiru
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2018, 2018 (01) : 180 - 200
  • [35] More Constructions of Light MDS Transforms Based on Known MDS Circulant Matrices
    Wang, Jin-Bo
    Wu, You
    Zhou, Yu
    INFORMATION, 2022, 13 (07)
  • [36] Direct construction of quasi-involutory recursive-like MDS matrices from 2-cyclic codes
    Cauchois, Victor
    Loidreau, Pierre
    Merkiche, Nabil
    IACR TRANSACTIONS ON SYMMETRIC CRYPTOLOGY, 2016, 2016 (02) : 80 - 98
  • [37] Construction of MDS matrices from minors of an MDS matrix
    Rishakani, A. Mahmoodi
    Dabanloo, Y. Fekri
    Dehnavi, S. M.
    Maimani, Hamidreza
    2015 12TH INTERNATIONAL IRANIAN SOCIETY OF CRYPTOLOGY CONFERENCE ON INFORMATION SECURITY AND CRYPTOLOGY (ISCISC), 2015, : 48 - 51
  • [38] Construction of Recursive MDS Matrices Using DLS Matrices
    Gupta, Kishan Chand
    Pandey, Sumit Kumar
    Samanta, Susanta
    PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2022, 2022, 13503 : 3 - 27
  • [39] On the direct construction of recursive MDS matrices
    Gupta, Kishan Chand
    Pandey, Sumit Kumar
    Venkateswarlu, Ayineedi
    DESIGNS CODES AND CRYPTOGRAPHY, 2017, 82 (1-2) : 77 - 94
  • [40] On the direct construction of recursive MDS matrices
    Kishan Chand Gupta
    Sumit Kumar Pandey
    Ayineedi Venkateswarlu
    Designs, Codes and Cryptography, 2017, 82 : 77 - 94