Direct Construction of Recursive MDS Diffusion Layers using Shortened BCH Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Direct Construction of Recursive MDS Diffusion Layers using Shortened BCH Codes

Abstract

MDS matrices allow to build optimal linear diffusion layers in block ciphers. However, MDS matrices cannot be sparse and usually have a large description, inducing costly software/hardware implementations. Recursive MDS matrices allow to solve this problem by focusing on MDS matrices that can be computed as a power of a simple companion matrix, thus having a compact description suitable even for constrained environ- ments. However, up to now, finding recursive MDS matrices required to perform an exhaustive search on families of companion matrices, thus limiting the size of MDS matrices one could look for. In this article we propose a new direct construction based on shortened BCH codes, al- lowing to efficiently construct such matrices for whatever parameters. Unfortunately, not all recursive MDS matrices can be obtained from BCH codes, and our algorithm is not always guaranteed to find the best matrices for a given set of parameters.
Fichier principal
Vignette du fichier
article.pdf (372.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01044597 , version 1 (23-07-2014)
hal-01044597 , version 2 (13-12-2014)

Identifiers

Cite

Daniel Augot, Matthieu Finiasz. Direct Construction of Recursive MDS Diffusion Layers using Shortened BCH Codes. 21st International Workshop on Fast Software Encryption, FSE 2014, London, UK, March 3-5, Mar 2014, London, United Kingdom. pp.3-17, ⟨10.1007/978-3-662-46706-0_1⟩. ⟨hal-01044597v2⟩
544 View
247 Download

Altmetric

Share

Gmail Facebook X LinkedIn More