Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
From MaRDI portal
Publication:1977757
DOI10.1023/A:1006326723002zbMath0968.68052OpenAlexW1583771634MaRDI QIDQ1977757
Publication date: 1 May 2001
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1006326723002
Related Items
Satisfiability in Boolean Logic (SAT problem) is polynomial? ⋮ Side-channel cryptographic attacks using pseudo-Boolean optimization ⋮ Unnamed Item ⋮ On black-box optimization in divide-and-conquer SAT solving ⋮ How to fake an RSA signature by encoding modular root finding as a SAT problem ⋮ Algebraic and Slide Attacks on KeeLoq ⋮ Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results ⋮ Compiling problem specifications into SAT ⋮ ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH ⋮ ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM ⋮ Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA ⋮ Algebraic Cryptanalysis of the Data Encryption Standard ⋮ Unnamed Item ⋮ Secure information hiding based on computationally intractable problems ⋮ Algebraic attacks using SAT-solvers ⋮ Practical Algebraic Attacks on the Hitag2 Stream Cipher ⋮ Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System ⋮ An algebraic attack to the Bluetooth stream cipher \textsc{E0} ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages ⋮ DiMo -- discrete modelling using propositional logic ⋮ Scalable SAT solving in the cloud ⋮ Logical cryptanalysis with WDSat
Uses Software
