Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages

DOI10.3233/SAT190099zbMath1486.94122MaRDI QIDQ5015592

Jorge jun. Nakahara, Dirk Van Heule, Frederic Lafitte

Publication date: 9 December 2021

Published in: Journal on Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)

zbMATH Keywords

algebraic cryptanalysisSAT solversweak keyspreimage attacksautomated cryptanalysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results

Uses Software

• R
• CryptoMiniSat
• CryptoSAT

Cites Work

• Unnamed Item
• Unnamed Item
• A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
• Cryptanalysis of MD4
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Cryptanalysis of WIDEA
• Algebraic attacks using SAT-solvers
• Revisiting the IDEA Philosophy
• Attacking Bivium Using SAT Solvers
• Algebraic and Slide Attacks on KeeLoq
• MD4 is Not One-Way
• Algebraic Cryptanalysis
• Algebraic Cryptanalysis of SMS4: Gröbner Basis Attack and SAT Attack Compared
• Inversion Attacks on Secure Hash Functions Using sat Solvers
• Markov Ciphers and Differential Cryptanalysis
• Collisions for the WIDEA-8 Compression Function
• Information Security and Privacy
• Theory and Applications of Satisfiability Testing
• How to Break MD5 and Other Hash Functions
• Frontiers of Combining Systems
• Progress in Cryptology - INDOCRYPT 2004
• Applications of SAT Solvers to Cryptanalysis of Hash Functions

This page was built for publication: Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages