Lightweight multiplication in GF(2ⁿ) with applications to MDS matrices
From MaRDI portal
Publication:2835604
DOI10.1007/978-3-662-53018-4_23zbMATH Open1378.94022OpenAlexW2500084106MaRDI QIDQ2835604FDOQ2835604
Authors: Christof Beierle, Thorsten Kranz, Gregor Leander 
Publication date: 30 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53018-4_23
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
- Keccak
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factorization of polynomials over finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Serpent: A New Block Cipher Proposal
- Basic algebra. Along with a companion volume `Advanced algebra'
- The LED block cipher
- The PHOTON family of lightweight hash functions
- The block cipher Square
- Block ciphers -- focus on the linear layer (feat. PRIDE)
- Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes
- LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations
- Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions
- Recursive diffusion layers for block ciphers and hash functions
- Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications
- Whirlwind: a new cryptographic hash function
- Lightweight MDS Involution Matrices
- Lightweight MDS Generalized Circulant Matrices
- On the Construction of Lightweight Circulant Involutory MDS Matrices
- FOAM: Searching for Hardware-Optimal SPN Structures and Components with a Fair Comparison
- Matrix Representation of Finite Fields
- A Deeper Understanding of the XOR Count Distribution in the Context of Lightweight Cryptography
- Correlation analysis in \(\mathrm{GF}(2^n)\)
Cited In (22)
- Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices
- A framework to optimize implementations of matrices
- More Results on Shortest Linear Programs
- Recursive MDS matrices over finite commutative rings
- Four by four MDS matrices with the fewest XOR gates based on words
- Constructions of Iterative Near-MDS Matrices with the Lowest XOR Count
- Cryptographic properties of cyclic binary matrices
- 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
- Optimizing the depth of quantum implementations of linear layers
- On the construction of \(4 \times 4\) lightweight involutory MDS matrices over \(\mathbb{F}_{2^8}\)
- Almost involutory recursive MDS diffusion layers
- A proof of the Beierle-Kranz-Leander conjecture related to lightweight multiplication in \(\mathbb{F}_{2^n} \)
- A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\)
- Improved heuristics for low-latency implementations of linear layers
- Complexity Reduction of Constant Matrix Computations over the Binary Field
- Provable one-XOR matrices for construction of 4 × 4 hardware-oriented MDS diffusion layers
- On the construction of involutory MDS matrices over \(\mathbb{F}_{2^m}\)
- FFCSA - finite field constructions, search, and algorithms
- On the construction of near-MDS matrices
- Construction of recursive MDS matrices using DLS matrices
Uses Software
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)
