A framework to optimize implementations of matrices
From MaRDI portal
Recommendations
- On the construction of \(20 \times 20\) and \(2 4 \times 24\) binary matrices with good implementation properties for lightweight block ciphers and hash functions
- Improved heuristics for low-latency implementations of linear layers
- Complexity Reduction of Constant Matrix Computations over the Binary Field
- Algorithm 898
- Lightweight multiplication in \(\mathrm{GF}(2^n)\) with applications to MDS matrices
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- A fast new DES implementation in software
- Algebraic aspects of the advanced encryption standard.
- Analysis of Toeplitz MDS matrices
- Communication Theory of Secrecy Systems*
- Differential cryptanalysis of DES-like cryptosystems
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
- Lightweight MDS generalized circulant matrices
- Lightweight MDS involution matrices
- Lightweight multiplication in \(\mathrm{GF}(2^n)\) with applications to MDS matrices
- Logic minimization techniques with applications to cryptology
- More Results on Shortest Linear Programs
- On the Construction of Lightweight Circulant Involutory MDS Matrices
- On the Shortest Linear Straight-Line Program for Computing Linear Forms
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
- Selected Areas in Cryptography
- The 128-Bit Blockcipher CLEFIA (Extended Abstract)
- Whirlwind: a new cryptographic hash function
Cited in
(6)- Further insights on constructing quantum circuits for Camellia block cipher
- Optimizing matrix operations in \(\mathbb Z_2\) by word packing
- Three input exclusive-or gate support for Boyar-Peralta's algorithm
- Improved quantum circuits for AES: reducing the depth and the number of qubits
- Improved heuristics for low-latency implementations of linear layers
- Complexity Reduction of Constant Matrix Computations over the Binary Field
This page was built for publication: A framework to optimize implementations of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826298)