Pages that link to "Item:Q2751040"
From MaRDI portal
The following pages link to Logical cryptanalysis as a SAT problem (Q2751040):
Displaying 6 items.
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard (Q1977757) (← links)
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities (Q2424888) (← links)
- On black-box optimization in divide-and-conquer SAT solving (Q5085259) (← links)
- (Q5109519) (← links)
- Applications of SAT Solvers to Cryptanalysis of Hash Functions (Q5756584) (← links)