Pages that link to "Item:Q1977757"
From MaRDI portal
The following pages link to Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard (Q1977757):
Displaying 24 items.
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- An algebraic attack to the Bluetooth stream cipher \textsc{E0} (Q2081340) (← links)
- DiMo -- discrete modelling using propositional logic (Q2118304) (← links)
- Scalable SAT solving in the cloud (Q2118345) (← links)
- Logical cryptanalysis with WDSat (Q2118349) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Side-channel cryptographic attacks using pseudo-Boolean optimization (Q2398519) (← links)
- Compiling problem specifications into SAT (Q2457689) (← links)
- (Q2741526) (← links)
- Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA (Q2794507) (← links)
- Algebraic attacks using SAT-solvers (Q3085997) (← links)
- Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System (Q3100320) (← links)
- Practical Algebraic Attacks on the Hitag2 Stream Cipher (Q3399209) (← links)
- Algebraic and Slide Attacks on KeeLoq (Q3525663) (← links)
- Secure information hiding based on computationally intractable problems (Q4440673) (← links)
- Applications of SAT Solvers in Cryptanalysis: Finding Weak Keys and Preimages (Q5015592) (← links)
- Satisfiability in Boolean Logic (SAT problem) is polynomial? (Q5071401) (← links)
- On black-box optimization in divide-and-conquer SAT solving (Q5085259) (← links)
- (Q5109519) (← links)
- (Q5150405) (← links)
- (Q5150565) (← links)
- ANALYSIS AND SOLUTION OF DISCRETE OPTIMIZATION PROBLEMS WITH LOGICAL CONSTRAINTS ON THE BASE OF L-PARTITION APPROACH (Q5150716) (← links)
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM (Q5151087) (← links)
- Algebraic Cryptanalysis of the Data Encryption Standard (Q5447514) (← links)
