Open AccessDirect construction of quasi-involutory recursive-like MDS matrices from 2-cyclic codes
Author(s) -
Victor Cauchois,
Pierre Loidreau,
Nabil Merkiche
Publication year - 2017
Publication title -
iacr transaction on symmetric cryptology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.715
H-Index - 10
ISSN - 2519-173X
DOI - 10.46586/tosc.v2016.i2.80-98
Subject(s) - mathematics , matrix (chemical analysis) , vector space , inverse , algebraic number , block (permutation group theory) , row and column spaces , algebraic structure , row , discrete mathematics , algorithm , algebra over a field , pure mathematics , computer science , combinatorics , mathematical analysis , materials science , geometry , database , composite material
A good linear diffusion layer is a prerequisite in the design of block ciphers. Usually it is obtained by combining matrices with optimal diffusion property over the Sbox alphabet. These matrices are constructed either directly using some algebraic properties or by enumerating a search space, testing the optimal diffusion property for every element. For implementation purposes, two types of structures are considered: Structures where all the rows derive from the first row and recursive structures built from powers of companion matrices. In this paper, we propose a direct construction for new recursive-like MDS matrices. We show they are quasi-involutory in the sense that the matrix-vector product with the matrix or with its inverse can be implemented by clocking a same LFSR-like architecture. As a direct construction, performances do not outperform the best constructions found with exhaustive search. However, as a new type of construction, it offers alternatives for MDS matrices design.