[Resource Topic] 2016/1112: Direct construction of quasi-involutory recursive-like MDS matrices from $2$-cyclic codes

Welcome to the resource topic for 2016/1112

Direct construction of quasi-involutory recursive-like MDS matrices from 2-cyclic codes

Authors: Victor Cauchois, Pierre Loidreau, Nabil Merkiche


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.

ePrint: https://eprint.iacr.org/2016/1112

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .