Algebraic attacks using SAT-solvers

DOI10.1515/GCC.2010.016zbMATH Open1213.13043MaRDI QIDQ3085997FDOQ3085997

Philipp Jovanovic, Martin Kreuzer

Publication date: 1 April 2011

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

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

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)

Cites Work

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

Cited In (8)

• Algebraic Attacks Using IP-Solvers
• On conversions from CNF to ANF
• Cryptography and Coding
• Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages
• Title not available (Why is that?)
• 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)