On the Shortest Linear Straight-Line Program for Computing Linear Forms
From MaRDI portal
Recommendations
- Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT
- Logic minimization techniques with applications to cryptology
- Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
- On the Simplification and Equivalence Problems for Straight-Line Programs
- Approximating linear programming is log-space complete for P
Cited in
(14)- Logic minimization techniques with applications to cryptology
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
- The Extraordinary Power of Division in Straight Line Programs
- Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT
- scientific article; zbMATH DE number 7561750 (Why is no real title available?)
- Improved heuristics for low-latency implementations of linear layers
- On construction of lightweight MDS matrices
- How fast can SM4 be in software?
- Constructions of Iterative Near-MDS Matrices with the Lowest XOR Count
- More Results on Shortest Linear Programs
- On the construction of near-MDS matrices
- Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication
- Leveraging smaller finite fields for more efficient ZK-friendly hash functions
- A framework to optimize implementations of matrices
This page was built for publication: On the Shortest Linear Straight-Line Program for Computing Linear Forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599124)
