Applications of SAT Solvers to Cryptanalysis of Hash Functions

2006/01/01 by Ilya Mironov, Lintao Zhang · 3 citations
Computer Science · #Coding theory and cryptography #Cryptographic Implementations and Security #Formal Methods in Verification

paper · doi:10.1007/11814948_13

crossref issued 2006/01/01 · crossref published 2006/01/01 · crossref published-print 2006/01/01 · openalex publication_date 2006/01/01 · crossref created 2006/07/18 · crossref deposited 2020/11/17 · openalex created_date 2025/10/10 · crossref indexed 2026/07/28 · openalex updated_date 2026/07/29

Citations

• Logical Cryptanalysis as a SAT Problem
• A method for obtaining digital signatures and public-key cryptosystems

Cited by

• Inversion Attacks on Secure Hash Functions Using sat Solvers
• Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results
• Boolean satisfiability problem [wikipedia]