On the Shortest Linear Straight-Line Program for Computing Linear Forms

DOI10.1007/978-3-540-85238-4_13zbMath1173.68875DBLPconf/mfcs/BoyarMP08OpenAlexW1600295433WikidataQ62472255 ScholiaQ62472255MaRDI QIDQ3599124

Philip Matthews, René Peralta, Joan. Boyar

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (11)

A framework to optimize implementations of matrices ⋮ Logic minimization techniques with applications to cryptology ⋮ Improved heuristics for low-latency implementations of linear layers ⋮ On construction of lightweight MDS matrices ⋮ How fast can SM4 be in software? ⋮ Optimizing S-Box Implementations for Several Criteria Using SAT Solvers ⋮ Constructions of Iterative Near-MDS Matrices with the Lowest XOR Count ⋮ More Results on Shortest Linear Programs ⋮ Unnamed Item ⋮ On the construction of near-MDS matrices ⋮ Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication

This page was built for publication: On the Shortest Linear Straight-Line Program for Computing Linear Forms