Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes
From MaRDI portal
Publication:2946900
DOI10.1007/978-3-662-46706-0_1zbMath1382.94054arXiv1412.4626OpenAlexW66229595MaRDI QIDQ2946900
Matthieu Finiasz, Daniel Augot
Publication date: 18 September 2015
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.4626
Related Items (22)
Construction of higher-level MDS matrices in nested SPNs ⋮ Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices ⋮ Applications of design theory for the constructions of MDS matrices for lightweight cryptography ⋮ Format Preserving Sets: On Diffusion Layers of Format Preserving Encryption Schemes ⋮ Construction of orthomorphic $\mathrm{MDS}$ matrices with primitive characteristic polynomial ⋮ Randomized nonlinear software-oriented MDS diffusion layers ⋮ Differential Attacks Against SPN: A Thorough Analysis ⋮ Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications ⋮ Construction of recursive MDS matrices using DLS matrices ⋮ On circulant involutory MDS matrices ⋮ Almost involutory recursive MDS diffusion layers ⋮ Recursive MDS matrices over finite commutative rings ⋮ On the Construction of Lightweight Circulant Involutory MDS Matrices ⋮ SOME METHODS FOR CONSTRUCTING MDS-MATRICES OVER FINITE FIELD ⋮ 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 ⋮ Cellular automata based S-boxes ⋮ Unnamed Item ⋮ Construction of MDS matrices from generalized Feistel structures ⋮ Constructing Lightweight Optimal Diffusion Primitives with Feistel Structure ⋮ Lightweight Multiplication in $$GF(2^n)$$ with Applications to MDS Matrices
This page was built for publication: Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes
