Cryptographically significant MDS matrices over finite fields: a brief survey and some generalized results
From MaRDI portal
(Redirected from Publication:2274248)
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
(33)- Some classes of the MDS matrices over a finite field
- Direct constructions of (involutory) MDS matrices from block Vandermonde and Cauchy-like matrices
- Construction of MDS matrices from generalized Feistel structures
- The inverse of circulant matrices over \(\mathrm{GF}(2^m )\)
- On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\)
- Recursive MDS matrices over finite commutative rings
- Applications of design theory for the constructions of MDS matrices for lightweight cryptography
- scientific article; zbMATH DE number 6830787 (Why is no real title available?)
- On construction of involutory MDS matrices from Vandermonde matrices in \(\mathrm{GF}(2^q)\)
- Experimental methods for constructing MDS matrices of a special form
- eSPF: A Family of Format-Preserving Encryption Algorithms Using MDS Matrices
- A note on semi-orthogonal (G-matrix) and semi-involutory MDS matrices
- Introducing a new connection between the entries of MDS matrices constructed by generalized Cauchy matrices in \(GF(2^q)\)
- Construction of recursive MDS matrices using DLS matrices
- FUTURE: a lightweight block cipher using an optimal diffusion matrix
- 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
- A new algorithm for computing branch number of non-singular matrices over finite fields
- On the counting of involutory MDS matrices
- Combinatorial designs and cellular automata: a survey
- On the study of semi-involutory and semi-orthogonal matrices
- Invariant subspaces of matrices with a nontrivial automorphism group
- Using the automorphism group to construct MDS-matrices
- A note on cyclic MDS and non-MDS matrices
- On the circulant matrix MDS testing and the search for circulant MDS matrices
- Construction of all MDS and involutory MDS matrices
- Circulant, circulant-like and orthogonal MDS generalized Cauchy matrices
- A family of cyclic codes with increasing dimensions and fixed minimum distances
- On the direct construction of MDS and near-MDS matrices
- On the construction of ultra-light MDS matrices
- Leveraging smaller finite fields for more efficient ZK-friendly hash functions
- Involutory-multiple-lightweight MDS matrices based on Cauchy-type 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)