Cryptographically significant MDS matrices over finite fields: a brief survey and some generalized results
From MaRDI portal
Publication:2274248
DOI10.3934/AMC.2019045zbMATH Open1419.94038OpenAlexW2952493348WikidataQ127635388 ScholiaQ127635388MaRDI QIDQ2274248FDOQ2274248
Authors: Kishan Chand Gupta, Sumit Kumar Pandey, Indranil Ghosh Ray, Susanta Samanta
Publication date: 19 September 2019
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2019045
Recommendations
- Direct constructions of (involutory) MDS matrices from block Vandermonde and Cauchy-like matrices
- Experimental methods for constructing MDS matrices of a special form
- On Constructions of Involutory MDS Matrices
- On construction of involutory MDS matrices from Vandermonde matrices in \(\mathrm{GF}(2^q)\)
- scientific article; zbMATH DE number 6830787
Cited In (20)
- Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices
- eSPF: A Family of Format-Preserving Encryption Algorithms Using MDS Matrices
- Direct constructions of (involutory) MDS matrices from block Vandermonde and Cauchy-like matrices
- FUTURE: a lightweight block cipher using an optimal diffusion matrix
- Recursive MDS matrices over finite commutative rings
- Applications of design theory for the constructions of MDS matrices for lightweight cryptography
- On construction of involutory MDS matrices from Vandermonde matrices in \(\mathrm{GF}(2^q)\)
- A note on semi-orthogonal (G-matrix) and semi-involutory MDS matrices
- Construction of MDS matrices from generalized Feistel structures
- On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\)
- Experimental methods for constructing MDS matrices of a special form
- Introducing a new connection between the entries of MDS matrices constructed by generalized Cauchy matrices in \(GF(2^q)\)
- Some classes of the MDS matrices over a finite field
- The inverse of circulant matrices over \(\mathrm{GF}(2^m )\)
- Title not available (Why is that?)
- A new algorithm for computing branch number of non-singular matrices over finite fields
- A few negative results on constructions of MDS matrices using low XOR matrices
- MDS constacyclic codes of length \(q+1\) over \(\mathrm{GF}(q)\)
- On the construction of near-MDS matrices
- Construction of recursive MDS matrices using DLS matrices
This page was built for publication: Cryptographically significant MDS matrices over finite fields: a brief survey and some generalized results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274248)