Applications of design theory for the constructions of MDS matrices for lightweight cryptography
Journal of Mathematical Cryptology
In this paper, we observe simple yet subtle interconnections among design theory, coding theory and cryptography. Maximum distance separable (MDS) matrices have applications not only in coding theory but are also of great importance in the design of block ciphers and hash functions. It is nontrivial to find MDS matrices which could be used in lightweight cryptography. In the SAC 2004 paper , Junod and Vaudenay considered bi-regular matrices which are useful objects to build MDS matrices. Bi-regular matrices are those matrices all of whose entries are nonzero and all of whose 2 × 2 submatrices are nonsingular. Therefore MDS matrices are bi-regular matrices, but the converse is not true. They proposed the constructions of efficient MDS matrices by studying the two major aspects of a d × d bi-regular matrix M, namely v1(M), i.e. the number of occurrences of 1 in M, and c1(M), i.e. the number of distinct elements in M other than 1. They calculated the maximum number of ones that can occur in a d × d bi-regular matrices, i.e. vd,d1 for d up to 8, but with their approach, finding vd,d1 for d ≥ 9 seems difficult. In this paper, we explore the connection between the maximum number of ones in bi-regular matrices and the incidence matrices of Balanced Incomplete Block Design (BIBD). In this paper, tools are developed to compute vd,d1 for arbitrary d. Using these results, we construct a restrictive version of d × d bi-regular matrices, introducing by calling almost-bi-regular matrices, having vd,d1 ones for d ≤ 21. Since, the number of ones in any d × d MDS matrix cannot exceed the maximum number of ones in a d × d bi-regular matrix, our results provide an upper bound on the number of ones in any d × d MDS matrix. We observe an interesting connection between Latin squares and bi-regular matrices and study the conditions under which a Latin square becomes a bi-regular matrix and finally construct MDS matrices from Latin squares. Also a lower bound of c1(M) is computed for d × d bi-regular matrices M such that v1(M) = vd,d1, where d = q2 + q + 1 and q is any prime power. Finally, d × d efficient MDS matrices are constructed for d up to 8 from bi-regular matrices having maximum number of ones and minimum number of other distinct elements for lightweight applications.
Gupta, Kishan Chand; Pandey, Sumit Kumar; and Ray, Indranil Ghosh, "Applications of design theory for the constructions of MDS matrices for lightweight cryptography" (2017). Journal Articles. 2537.