Using Walk-SAT and Rel-SAT for cryptographic key search

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 290-295

  Massacci, Fabio ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC ALGORITHMS; CRYPTOGRAPHIC KEY; DATA ENCRYPTION STANDARD; PROPOSITIONAL LOGIC; RANDOM PROBLEM; SEARCH ALGORITHMS; SEARCH PROBLEM; SEARCH TECHNIQUE;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CRYPTOGRAPHY; ENCODING (SYMBOLS); SECURITY OF DATA;

FORMAL LOGIC;

EID: 0343978359     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. R. Anderson & R. Needham. Programming satan's computer. In Computer Science Today - Recent Trends and Developments, LNCS 1000, pp. 426-440. Springer-Verlag, 1996.
2. D. Andleman & J. Reeds. On the cryptanalysis of rotor machines and substitution-permutations networks. IEEE Trans, on Inf. Theory, 28(4):578-584, 1982. (Pubitemid 12525109)
3. M. Ascione. Validazione e benchmarking dei BDD per la criptanalisi del DBS. Master's thesis, Facolta di Ingegneria, Univ. di Roma I "La Sapienza", April 1999. In Italian.
4. R. Bayardo & R. Schrag. Using CSP look-back techniques to solve real-world SAT instances, in Proc. ofAAAI-97. pp. 203-208. AAAI Press/The MIT Press, 1997.
5. E. Biham & A. Shamir. Differential cryptanalisis of DES-like cryptosystems. J of Crvptology 4(1): 3-72, 1991.
6. R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE TOC, 35(8):677-691, 1986. (Pubitemid 16629996)
7. J. Crawford &. L. Auton. Experimental results on the crossover point in random 3SAT. ALL 81(L2):31-57, 1996.
8. S. Cook & D. Mitchel. Finding hard instances of the satisfiability problem: A survey. In Satisfiability Problem: Theory and Applications, DIMACS Series in Discr. Math. and TCS, 25:1-17. AMS, 1997.
9. DES key search project information. Technical report, Cryptography Research Inc., 1998. Available on the web at http://www.cryptography.com/des/.
10. H. Feistel, W. Notz, and L. Smith. Some cryptographic techniques for machine-to-machine data communication. Proc. of the IEEE, 63(11): 1545 1554, 1975.
11. Committee on Payment, Settelment Systems, and the Group of Computer Experts of the Central Banks of the Group of Ten countries. Security of Electronic Money. Bank for International Settlements, Basle, August 1996.
12. Kautz. D. McAllester, and & B. Selman. Ex plotting Variable Dependency in Local Search Abstract in Abstracts of the Poster Sessions of L/C AI 97, 1997.
13. L. Marram & F. Massacci. A new challenge for automated reasoning: Verification and cryptanalysis of cryptographic algorithms. Tech. Rep. 5, Dip. di Informatica e Sistemistica, Univ. di Roma "La Sapienza", 1999.
14. M. Matsui. The first experimental cryptanalysis of the Data Encryption Standard. In Proc. of CRYPTO-94, LNCS 839, pp. 1-11." Springer Vei lag, 1994.
15. M. Matsui. Linear cryptanalysis method for des cipher. In Proc. of Eurocrypt 93. LNCS 765, pp. 368 397. Springer-Verlag, 1994.
16. NIST. Data encryption standard. Federal Information Processing Standards Publications FIPS PUB 46-2, National (U.S.) Bureau of Standards, Dec 1997. Supersedes FIPS PUB 46-1 of Jan. 1988 and FIPS PUB 46 of Jan. 1977.
17. OECD. Emerging market economy forum (EMEF): Report of the ministerial workshop on cryptography policy. OLIS SG/EMEF/ICCP(98)L Organization for Economic Co-operation and Development. Paris, Feb 1998.
18. P. Ryan & S. Schneider. An attack on a recurive authentication protocol: a cautionary tale. I PL, 65(15):7-16, 1998.
19. B. Schneier. Applied Cryptography: Protocols, Algorithms, and Source Code in C. John Wiley & Sons, 1994.
20. B. Selman, H. Kautz, and B. Cohen. Noise strategies for local search. In Proc. of AAA I-94, pp. 337-343. AAAI Press/The MIT Press, 1994.
21. B. Selman, H. Kautz, and D. McAllester. Ten challenges in propositional resoning and search. In Proc. UCAI-97, pp. n50 54. Morgan Kaufmann, 1997.