Logical Cryptanalysis as a SAT Problem

2000/02/01 by Fabio Massacci, Laura Marraro · 4 citations
Computer Science · #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Data Security

paper · doi:10.1023/a:1006326723002

crossref issued 2000/02/01 · crossref published 2000/02/01 · crossref published-print 2000/02/01 · openalex publication_date 2000/02/01 · crossref created 2002/12/22 · openalex created_date 2016/06/24 · crossref deposited 2025/06/05 · crossref indexed 2026/06/19 · openalex updated_date 2026/07/23

Citations

• Resolution for Quantified Boolean Formulas
• Generating hard satisfiability problems
• Graph-Based Algorithms for Boolean Function Manipulation
• Communication Theory of Secrecy Systems*

Cited by

• Applications of SAT Solvers to Cryptanalysis of Hash Functions
• Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results
• Boolean satisfiability problem [wikipedia]
• P versus NP problem [wikipedia]