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

Victor Cauchois; Pierre Loidreau; Nabil Merkiche

Paper 2016/1112

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

Victor Cauchois, Pierre Loidreau, and Nabil Merkiche

Abstract

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.

Metadata

Available format(s): PDF
Publication info: Published by the IACR in TOSC 2017
Contact author(s): victouf @ hotmail com
pierre loidreau @ m4x org
merkiche nabil @ gmail com
History: 2016-11-25: received
Short URL: https://ia.cr/2016/1112
License: CC BY

BibTeX

@misc{cryptoeprint:2016/1112,
      author = {Victor Cauchois and Pierre Loidreau and Nabil Merkiche},
      title = {Direct construction of quasi-involutory recursive-like {MDS} matrices from $2$-cyclic codes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/1112},
      year = {2016},
      url = {https://eprint.iacr.org/2016/1112}
}