Synthesizing shortest linear straight-line programs over GF(2) using SAT

DOI10.1007/978-3-642-14186-7_8MaRDI QIDQ4930580zbMATH OpenOpenAlexFDO

Authors Carsten Fuhs, Peter Schneider-Kamp

Publication date 29 September 2010

Published in Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14186-7_8

Mathematics Subject Classification ID

Classical propositional logic (03B05) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the Shortest Linear Straight-Line Program for Computing Linear Forms
• 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)\)
• scientific article; zbMATH DE number 1962894
• Small low-depth circuits for cryptographic applications

Cited in

(8)

• Improved upper bounds for the expected circuit complexity of dense systems of linear equations over \(\mathrm{GF}(2)\)
• Logic minimization techniques with applications to cryptology
• A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\)
• On the Shortest Linear Straight-Line Program for Computing Linear Forms
• Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
• Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits
• More Results on Shortest Linear Programs
• Synchronous counting and computational algorithm design

Describes a project that uses

Uses Software

• AProVE

This page was built for publication: Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930580)