Improved heuristics for low-latency implementations of linear layers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1293731
- More accurate division property propagations based on optimized implementations of linear layers
- scientific article; zbMATH DE number 1953309
- A faster algorithm for reducing the computational complexity of convolutional neural networks
- Incremental approximation by layer neural networks
- scientific article; zbMATH DE number 1217248
- Fast linear system solution by neural networks
Cites work
- \texttt{Midori}: a block cipher for low energy
- A framework to optimize implementations of matrices
- Algebraic aspects of the advanced encryption standard.
- Block ciphers -- focus on the linear layer (feat. PRIDE)
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- Construction of lightweight involutory MDS matrices
- 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
- On the Construction of Lightweight Circulant Involutory MDS Matrices
- On the Shortest Linear Straight-Line Program for Computing Linear Forms
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- The design of Rijndael. The Advanced Encryption Standard (AES)
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Three input exclusive-or gate support for Boyar-Peralta's algorithm
- Topological sorting of large networks
Cited in
(3)
This page was built for publication: Improved heuristics for low-latency implementations of linear layers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080928)
