Algebraic attacks using SAT-solvers

DOI10.1515/GCC.2010.016MaRDI QIDQ3085997zbMATH OpenFDO

Authors Philipp Jovanovic, Martin Kreuzer

Publication date 1 April 2011

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

zbMATH Keywords

algebraic cryptanalysisAESSAT solverpolynomial system solving

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Mechanization of proofs and logical operations (03B35) Solving polynomial systems; resultants (13P15)

Recommendations

• Algebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared
• Methods to solve algebraic equations in cryptanalysis
• Algebraic Attacks Using IP-Solvers
• Integrating algebraic and SAT solvers
• Using SAT solvers in large scale distributed algebraic attacks against low entropy keys

Cites work

• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard

Cited in

(13)

• Applications of SAT solvers in cryptanalysis: finding weak keys and preimages
• Integrating algebraic and SAT solvers
• Methods to solve algebraic equations in cryptanalysis
• A comparison of local reduction and SAT-solver based algebraic cryptanalysis of JH and Keccak
• Algebraic Attacks Using IP-Solvers
• On conversions from CNF to ANF
• Cryptography and Coding
• Algebraic attacks using binary decision diagrams
• Using SAT solvers in large scale distributed algebraic attacks against low entropy keys
• scientific article; zbMATH DE number 7199588 (Why is no real title available?)
• SAT solving using XOR-OR-AND normal forms.
• ALIAS: a modular tool for finding backdoors for SAT
• Algebraic Cryptanalysis

This page was built for publication: Algebraic attacks using SAT-solvers

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