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