Lightweight multiplication in GF(2ⁿ) with applications to MDS matrices
From MaRDI portal
Publication:2835604
Recommendations
- Lightweight MDS involution matrices
- On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\)
- On construction of lightweight MDS matrices
- Some methods for constructing MDS-matrices over finite field
- Lightweight MDS serial-type matrices with minimal fixed XOR count
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 503238 (Why is no real title available?)
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- A deeper understanding of the XOR count distribution in the context of lightweight cryptography
- Basic algebra. Along with a companion volume `Advanced algebra'
- Block ciphers -- focus on the linear layer (feat. PRIDE)
- Correlation analysis in \(\mathrm{GF}(2^n)\)
- Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications
- Direct construction of recursive MDS diffusion layers using shortened BCH codes
- FOAM: searching for hardware-optimal SPN structures and components with a fair comparison
- Factorization of polynomials over finite fields
- Keccak
- LS-designs: bitslice encryption for efficient masked software implementations
- Lightweight MDS generalized circulant matrices
- Lightweight MDS involution matrices
- Matrix Representation of Finite Fields
- On the Construction of Lightweight Circulant Involutory MDS Matrices
- Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions
- Recursive diffusion layers for block ciphers and hash functions
- Serpent: a new block cipher proposal
- The LED block cipher
- The PHOTON family of lightweight hash functions
- The block cipher \textsc{Square}
- Whirlwind: a new cryptographic hash function
Cited in
(24)- Recursive MDS matrices over finite commutative rings
- Four by four MDS matrices with the fewest XOR gates based on words
- Twin column parity mixers and Gaston. A new mixing layer and permutation
- Construction of MDS matrices from generalized Feistel structures
- Construction of lightweight involutory MDS matrices
- Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices
- A framework to optimize implementations of matrices
- Provable one-XOR matrices for construction of \(4 \times 4\) hardware-oriented MDS diffusion layers
- Constructions of Iterative Near-MDS Matrices with the Lowest XOR Count
- A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in \(\mathbb{F}_{2^n} \)
- On the construction of involutory MDS matrices over \(\mathbb{F}_{2^m}\)
- Cryptographic properties of cyclic binary matrices
- A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\)
- FFCSA - finite field constructions, search, and algorithms
- On the construction of near-MDS matrices
- XOR-counts and lightweight multiplication with fixed elements in binary finite fields
- On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\)
- Optimizing the depth of quantum implementations of linear layers
- Almost involutory recursive MDS diffusion layers
- Construction of recursive MDS matrices using DLS matrices
- Improved heuristics for low-latency implementations of linear layers
- Complexity Reduction of Constant Matrix Computations over the Binary Field
- A deeper understanding of the XOR count distribution in the context of lightweight cryptography
- More Results on Shortest Linear Programs
This page was built for publication: Lightweight multiplication in \(\mathrm{GF}(2^n)\) with applications to MDS matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835604)
