Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
From MaRDI portal
Publication:4930580
DOI10.1007/978-3-642-14186-7_8zbMath1306.68156MaRDI QIDQ4930580
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
68Q25: Analysis of algorithms and problem complexity
11Y16: Number-theoretic algorithms; complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
03B05: Classical propositional logic
Related Items
Optimizing S-Box Implementations for Several Criteria Using SAT Solvers, Synthesizing quantum circuits of AES with lower \(T\)-depth and less qubits, Synchronous counting and computational algorithm design, 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}\)
Uses Software