Direct construction of recursive MDS diffusion layers using shortened BCH codes

DOI10.1007/978-3-662-46706-0_1zbMATH Open1382.94054arXiv1412.4626OpenAlexW66229595MaRDI QIDQ2946900FDOQ2946900

Authors: Daniel Augot, Matthieu Finiasz 

Publication date: 18 September 2015

Published in: Fast Software Encryption (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1412.4626

Recommendations

• Towards a general construction of recursive MDS diffusion layers
• On the direct construction of recursive MDS matrices
• Construction of Recursive MDS Diffusion Layers from Gabidulin Codes
• Almost involutory recursive MDS diffusion layers
• Recursive MDS matrices over finite commutative rings

zbMATH Keywords

BCH codeslinear diffusionrecursive MDS matrices

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial codes (94B25)

Cited In (27)

• Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices
• On circulant involutory MDS matrices
• More Results on Shortest Linear Programs
• Some methods for constructing MDS-matrices over finite field
• Recursive MDS matrices over finite commutative rings
• Construction of higher-level MDS matrices in nested SPNs
• Lightweight multiplication in \(\mathrm{GF}(2^n)\) with applications to MDS matrices
• Randomized nonlinear software-oriented MDS diffusion layers
• Invariant subspaces in SPN block cipher
• Towards a general construction of recursive MDS diffusion layers
• Cellular automata based S-boxes
• Applications of design theory for the constructions of MDS matrices for lightweight cryptography
• Constructing lightweight optimal diffusion primitives with Feistel structure
• Construction of orthomorphic MDS matrices with primitive characteristic polynomial
• Construction of Recursive MDS Diffusion Layers from Gabidulin Codes
• Construction of MDS matrices from generalized Feistel structures
• Almost involutory recursive MDS diffusion layers
• \(4 \times 4\) recursive MDS matrices effective for implementation from Reed-Solomon code over \(GF(q)\) field
• On the Construction of Lightweight Circulant Involutory MDS Matrices
• Improving the security and efficiency of block ciphers based on LS-designs
• On the direct construction of recursive MDS matrices
• Differential attacks against SPN: a thorough analysis
• A few negative results on constructions of MDS matrices using low XOR matrices
• On the construction of near-MDS matrices
• Format Preserving Sets: On Diffusion Layers of Format Preserving Encryption Schemes
• Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications
• Construction of recursive MDS matrices using DLS matrices

This page was built for publication: Direct construction of recursive MDS diffusion layers using shortened BCH codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946900)