CIRCULANT, CIRCULANT-LIKE AND ORTHOGONAL MDS GENERALIZED CAUCHY MATRICES

被引:1
作者
Mousavi, Mohsen [1 ]
Esmaeili, Morteza [2 ,3 ]
Gulliver, T. Aaron [3 ]
机构
[1] Malek Ashtar Univ Technol, Fac Appl Sci, Esfahan, Iran
[2] Isfahan Univ Technol, Dept Math Sci, Esfahan, Iran
[3] Univ Victoria, Dept Elect & Comp Engn, Victoria, BC, Canada
关键词
Cauchy matrix; generalized cauchy matrix; MDS matrix; circulant matrix; circulant-like matrix; orthogonal matrix; block cipher; feistel cipher; CIPHERS;
D O I
10.3934/amc.2024020
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A matrix M over the filed F-q is called maximum distance separable (MDS) if all of its square submatrices are invertible. MDS generalized Cauchy (MDS-GC) matrices are important in both cryptography and coding theory. As an application, these matrices are used to provide diffusion in block ciphers. In this paper MDS-GC matrices over F-2k are constructed which are involutory, Hadamard, circulant or orthogonal. The construction is based on using linearly related Vandermonde matrices. First, the construction of nxn circulant MDS-GC matrices over F-2k is given for n a divisor of 2(k)-1; and an nxn circulant MDS-GC matrix C and its inverse C-1 are used to obtain the n x 2n matrix H = (C vertical bar vertical bar C-1) with square nonsingular submatrices. A class of 2(m) x 2(m) orthogonal MDS-GC matrices over F-2k is given subject to the divisibility of 2(k) - 1 by 2(m)-1. These orthogonal MDS-GC matrices are used to construct a new class of multiple MDS matrices over F-2k which have applications in the design of Feistel ciphers. The constructed n x n circulant matrices are also used to obtain (n + 1) x (n + 1) circulant-like MDS matrices over F-2k, and a closed-form expression for the inverse of these matrices is given. This is the first construction of circulant-like MDS matrices and their inverses which does not employ exhaustive search.
引用
收藏
页码:716 / 735
页数:20
相关论文
共 26 条
[1]   Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes [J].
Augot, Daniel ;
Finiasz, Matthieu .
FAST SOFTWARE ENCRYPTION, FSE 2014, 2015, 8540 :3-17
[2]   Lightweight Multiplication in GF(2n) with Applications to MDS Matrices [J].
Beierle, Christof ;
Kranz, Thorsten ;
Leander, Gregor .
ADVANCES IN CRYPTOLOGY - CRYPTO 2016, PT I, 2016, 9814 :625-653
[3]   On circulant involutory MDS matrices [J].
Cauchois, Victor ;
Loidreau, Pierre .
DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (2-3) :249-260
[4]  
Daemen J., 2002, The design of Rijndael: AES-the advanced encryption standard, DOI DOI 10.1007/978-3-662-04722-4
[5]  
Gupta Kishan Chand, 2014, Information Security Practice and Experience. 10th International Conference, ISPEC 2014. Proceedings: LNCS 8434, P564, DOI 10.1007/978-3-319-06320-1_41
[6]  
Gupta Kishan Chand, 2013, Progress in Cryptology - AFRICACRYPT 2013. 6th International Conference on Crytology in Africa. Proceedings, P43, DOI 10.1007/978-3-642-38553-7_3
[7]  
Gupta K.C., 2013, LNCS, P29, DOI DOI 10.1007/978-3-642-40588-43
[8]   CRYPTOGRAPHICALLY SIGNIFICANT MDS MATRICES OVER FINITE FIELDS: A BRIEF SURVEY AND SOME GENERALIZED RESULTS [J].
Gupta, Kishan Chand ;
Pandey, Sumit Kumar ;
Ray, Indranil Ghosh ;
Samanta, Susanta .
ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2019, 13 (04) :779-843
[9]   Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications [J].
Gupta, Kishan Chand ;
Ray, Indranil Ghosh .
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2015, 7 (02) :257-287
[10]   A New Construction and an Efficient Decoding Method for Rabin-Like Codes [J].
Hou, Hanxu ;
Han, Yunghsiang S. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (02) :521-533