Providing formal assurance is a key issue in computer security. Yet, automated reasoning tools have only been used for the verification of security protocols, and never for the verification and cryptanalysis of the cryptographic algorithms on which those protocols rely. We claim that one can use (propositional) logic for encoding the lowlevel properties of state-of-the-art cryptographic algorithms and then use automated theorem proving for reasoning about them. We call this approach logical cryptanalysis. In this framework, finding a model for a formula encoding an algorithm is equivalent to finding a key with a cryptanalytic attack. Other important properties can also be captured. Moreover, SAT benchmarks based on the encoding of cryptographic algorithms optimally share features of "real world" and random problems. Here we present a case study on the U.S. Data Encryption Standard (DES) and discuss how to obtain a manageable encoding of its properties. We have also teste...
|
2346
|
Graph-based algorithms for Boolean function manipulation
– Bryant
- 1986
|
|
802
|
A computing procedure for quantification theory
– Davis, Putnam
- 1960
|
|
567
|
Applied Cryptography: Protocols, Algorithms, and Source Code
– SCHNEIER
- 1996
|
|
489
|
Breaking and Fixing the Needham-Schroeder Public-Key Protocol using FDR
– Lowe
- 1996
|
|
442
|
Communication Theory of Secrecy Systems
– Shannon
- 1949
|
|
339
|
The inductive approach to verifying cryptographic protocols
– Paulson
- 1998
|
|
323
|
A machine program for theorem-proving
– Davis, Logemann, et al.
- 1962
|
|
294
|
Prudent engineering practice for cryptographic protocols
– Abadi, Needham
- 1996
|
|
226
|
Automated Analysis of Cryptographic Protocols Using Murphi
– Mitchell, Mitchell, et al.
|
|
197
|
The RC4 encryption algorithm
– Rivest
- 1992
|
|
164
|
Using CSP look-back techniques to solve real-world
– Bayardo, Schrag
- 1997
|
|
135
|
Proving properties of security protocols by induction
– Paulson
- 1997
|
|
114
|
Experimental results on the crossover point in random 3-SAT
– Crawford, Auton
- 1996
|
|
112
|
Knowledge compilation and theory approximation
– Selman, Kautz
- 1996
|
|
108
|
An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
– Cadoli, Schaerf, et al.
|
|
98
|
The First Experimental Cryptanalysis of the Data Encryption Standard
– Matsui
- 1994
|
|
87
|
Finding hard instances of the satisfiability problem: a survey, Satisfiability Problem: Theory and Applications Approximate Algorithms for MAX-SAT 143
– Cook, Mitchell
- 1997
|
|
87
|
An e#cient propositional prover
– SATO
- 1997
|
|
78
|
Cryptanalysis Method for DES Cipher
– Linear
- 1993
|
|
74
|
Programming Satan's Computer
– Anderson
- 1995
|
|
74
|
Generating hard satisfiability problem
– Selman, Mitchell, et al.
- 1996
|
|
53
|
A.: Resolution for quantified boolean formulas
– Büning, Karpinski, et al.
- 1995
|
|
48
|
Cryptographic Protocols
– DeMillo, Lynch, et al.
- 1982
|
|
37
|
Some cryptographic techniques for machine-to-machine data communications
– Feistel, Notz, et al.
- 1975
|
|
33
|
An efficient algorithm for unit propagation
– Zhang, Stickel
|
|
22
|
The CADE-14 ATP System Competition
– Sutcliffe, Suttner
- 1997
|
|
16
|
An Improvement of Davies' Attack on DES
– Biham, Biryukov
- 1997
|
|
16
|
Experimental analysis of the computational cost of evaluating quantified Boolean formulas
– Cadoli, Giovanardi, et al.
- 1997
|
|
14
|
Multiple valued minimization for PLA optimization
– Rudell, Sangiovanni-Vincentelli
- 1987
|
|
12
|
On the cryptanalysis of rotor machines and substitution-permutations networks
– Andleman, Reeds
- 1982
|
|
11
|
St*almarck's algorithm as a HOL derived rule
– Harrison
- 1996
|
|
10
|
An attack on a recurive authentication protocol. a cautionary tale
– Ryan, Schneider
- 1998
|
|
9
|
Eds.), Cliques, coloring, and satisfiability: Second DIMACS implementation challenge
– Johnson, Trick
- 1996
|
|
5
|
encryption standard. Federal Information Processing Standards
– Data
- 1997
|
|
4
|
Ten challenges in propositional resoning and search
– Selman, Kautz, et al.
- 1997
|
|
3
|
key search project information
– DES
- 1998
|
|
3
|
emerging market economy forum (EMEF): Report of the ministerial workshop on cryptography policy. OLIS SG/EMEF/ICCP(98)1, Organization for Economic Co-operation and Development
– OECD
- 1998
|
|
3
|
Validazione e benchmarking dei BDD per la criptanalisi del data encryption standard. Master's thesis, Facolt`a di Ingegneria, Univ. di Roma I "La Sapienza
– Ascione
- 1999
|
|
3
|
Differential cryptanalisis of DES-like cryptosystems
– Biham, Shamir
- 1991
|
|
3
|
Is the Data Encryption Standard a group? (preliminary abstract
– Kaliski, Rivest, et al.
- 1985
|
|
3
|
A new challenge for automated reasoning: Verification and cryptanalysis of cryptographic algorithms
– Marraro, Massacci
- 1999
|
|
3
|
Settelment Systems, and the Group of Computer Experts of the central banks of the Group of Ten countries
– Payment
- 1996
|
|
2
|
Espresso 1OCTTOOLS
– Rudell
- 1988
|
|
1
|
is not a group
– DES
- 1992
|
|
1
|
Analisi crittografica del DES mediante logica booleana. Master's thesis, Facolt`a di Ingegneria, Univ. di Roma I "La Sapienza
– Marraro
- 1998
|
|
1
|
Using walk-SAT and look-back CSP for cryptographic key search
– Massacci
- 1999
|
|
1
|
Secure Electronic Transaction - Business Specifications
– Mastercard
- 1996
|
|
