Logical analysis of hash functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3717 LNAI, Issue , 2005, Pages 200-215

  Jovanović, Dejan ^a   Janičić, Predrag ^b  

^a MATHEMATICAL INSTITUTE   (Serbia)

^b Faculty of Mathematics   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; FUNCTIONS; PROBLEM SOLVING; SEMANTICS;

CRYPTOGRAPHIC FUNCTIONS; HASH FUNCTIONS; LOGICAL ANALYSIS; PROPOSITIONAL FORMULAE;

FORMAL LOGIC;

EID: 33646195234     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_11     Document Type: Conference Paper

References (20)

1. D. Achlioptas, C.P. Gomes, H.A. Kautz, and B. Selman. Generating satisfiable problem instances. In Proceedings of the 17th National Conference on AI and 12th Conference on Innovative Applications of AI. AAAI Press / The MIT Press, 2000.
2. D. Achlioptas, L. M. Kirousis, E. Kranakis, and D. Krizanc. Rigorous results for random 2 + p-SAT. Theoretical Computer Science, 265:109-129, 2001.
3. Stephen A. Cook. The complexity of theorem-proving procedures. In STOC '71. ACM Press, 1971.
4. Stephen A. Cook and David G. Mitchell. Finding hard instances of the satisfiability problem: A survey. In Satisfiability Problem: Theory and Applications, volume 35 of DIMACS. American Mathematical Society, 1997.
5. Ivan Bjerre Damgård. A design principle for hash functions. In CRYPTO '89. Springer-Verlag New York, Inc., 1989.
6. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, 1962.
7. Uwe Egly. On different structure-preserving translations to normal form. Journal of Symbolic Computation, 22(2):121-142, 1996.
8. Ian Gent. On the stupid algorithm for satisfiability. Technical Report APES-03-1998, Department of Computer Science, University of Strathclyde, 1998.
9. Ian P. Gent and Toby Walsh. The SAT phase transition. In Proceedings of ECAI-94, pages 105-109, 1994.
10. I.P. Gent, E. Macintyre., P. Prosser, and T. Walsh. The constraidness of search. In Proceedings of AAAI-96, pages 246-252, Menlo Park, AAAI Press/MIT Press., 1996.
11. A. Lenstra, X. Wang, and B. de Weger. Colliding X.509 certificates. Cryptology ePrint Archive, Report 2005/067, 2005. URL: http://eprint.iacr.org/.
12. Fabio Massacci and Laura Marraro. Logical cryptanalysis as a SAT problem. Journal of Automated Reasoning, 24(1-2):165-203, 2000.
13. Ralph C. Merkle. One way hash functions and DES. In Gilles Brassard, editor, CRYPTO '89. Springer-Verlag New York, Inc., 1989.
14. G. David Mitchell, Bart Selman, and J. Hector Levesque. Hard and easy distributions of sat problems. In AAAI-92. AAAI Press/The MIT Press, 1992.
15. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: engineering an efficient SAT solver. In DAC '01. ACM Press, 2001.
16. Ronald L. Rivest. The MD4 message digest algorithm. RFC 1320, The Internet Engineering Task Force, April 1992.
17. Ronald L. Rivest. The MD5 message digest algorithm. RFC 1321, The Internet Engineering Task Force, April 1992.
18. G. S. Tseitin. On the complexity of derivations in propositional calculus. In The Automation of Reasoning. Springer-Verlag, 1983.
19. Xiaoyun Wang, Dengguo Feng, Xuejia Lai, and Hongbo Yu. Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive, Report 2004/199, 2004. URL: http://eprint.iacr.org/.
20. Lintao Zhang and Sharad Malik. The quest for efficient Boolean satisfiability solvers. In CAV '02. Springer-Verlag, 2002.