Logical cryptanalysis as a SAT problem

MaRDI QIDQ2751040zbMATH OpenFDO

Authors Fabio Massacci, Laura Marraro

Publication date 21 October 2001

zbMATH Keywords

cryptographic algorithmslogical cryptanalysis

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Attacking Bivium Using SAT Solvers
• Applications of SAT solvers in cryptanalysis: finding weak keys and preimages
• Applications of SAT Solvers to Cryptanalysis of Hash Functions
• Frontiers of Combining Systems

Cited in

(20)

• How to fake an RSA signature by encoding modular root finding as a SAT problem
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
• scientific article; zbMATH DE number 1705165 (Why is no real title available?)
• SAT-approach to cryptography of some stream ciphering systems
• Parallel logical cryptanalysis of the generator A5/1 in BNB-grid system
• Formalizing Dangerous SAT Encodings
• ``Logic wins!
• scientific article; zbMATH DE number 1962894 (Why is no real title available?)
• Applications of SAT solvers in cryptanalysis: finding weak keys and preimages
• On black-box optimization in divide-and-conquer SAT solving
• scientific article; zbMATH DE number 7199588 (Why is no real title available?)
• Global optimization problems associated with cryptographic analysis of asymmetric ciphers
• Solving of cryptanalysis problems in grid systems (by the example of BOINC)
• Minimization of functionals associated with problems of cryptographic analysis of asymmetric ciphers.
• SAT-Based Analysis of Cellular Automata
• Frontiers of Combining Systems
• Applications of SAT Solvers to Cryptanalysis of Hash Functions
• CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms
• Differential cryptanalysis with SAT, SMT, MILP, and CP: a detailed comparison for bit-oriented primitives

Describes a project that uses

Uses Software

• SATO

This page was built for publication: Logical cryptanalysis as a SAT problem

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