Abstract
In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducing cryptanalysis problems to the satisfiability problem. The approach is general, elegant, and does not require any human expertise on the construction of a specific cryptographic function. By using this approach, we developed a technique for generating hard and satisfiable propositional formulae and hard and unsatisfiable propositional formulae. In addition, one can finely tune the hardness of generated formulae. This can be very important for different applications, including testing (complete or incomplete) sat solvers. The uniform logical analysis of cryptographic functions can be used for comparison between different functions and can expose weaknesses of some of them (as shown for md4 in comparison with md5).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Achlioptas, D., Gomes, C.P., Kautz, H.A., Selman, B.: 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)
Achlioptas, D., Kirousis, L.M., Kranakis, E., Krizanc, D.: Rigorous results for random 2 + p-SAT. Theoretical Computer Science 265, 109–129 (2001)
Stephen, A.: Cook. The complexity of theorem-proving procedures. In: STOC 1971. ACM Press, New York (1971)
Cook, S.A., Mitchell, D.G.: Finding hard instances of the satisfiability problem: A survey. In: Satisfiability Problem: Theory and Applications. DIMACS, vol. 35. American Mathematical Society, Providence (1997)
Damgård, I.B.: A design principle for hash functions. In: CRYPTO 1989. Springer, New York (1989)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5(7), 394–397 (1962)
Egly, U.: On different structure-preserving translations to normal form. Journal of Symbolic Computation 22(2), 121–142 (1996)
Gent, I.: On the stupid algorithm for satisfiability. Technical Report APES-03-1998, Department of Computer Science, University of Strathclyde (1998)
Gent, I.P., Walsh, T.: The SAT phase transition. In: Proceedings of ECAI 1994, pp. 105–109 (1994)
Gent, I.P., Macintyre., E., Prosser, P., Walsh, T.: The constraidness of search. In: Proceedings of AAAI 1996, pp. 246–252. AAAI Press/MIT Press, Menlo Park (1996)
Lenstra, A., Wang, X., de Weger, B.: Colliding X.509 certificates. Cryptology ePrint Archive, Report 2005/067 (2005), http://eprint.iacr.org/
Massacci, F., Marraro, L.: Logical cryptanalysis as a SAT problem. Journal of Automated Reasoning 24(1-2), 165–203 (2000)
Merkle, R.C.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. Springer, New York (1989)
Mitchell, G.D., Selman, B., Levesque, J.H.: Hard and easy distributions of sat problems. In: AAAI 1992. AAAI Press/The MIT Press (1992)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: DAC 2001. ACM Press, New York (2001)
Rivest, R.L.: The MD4 message digest algorithm. RFC 1320, The Internet Engineering Task Force (April 1992)
Rivest, R.L.: The MD5 message digest algorithm. RFC 1321, The Internet Engineering Task Force (April 1992)
Tseitin, G.S.: On the complexity of derivations in propositional calculus. In: The Automation of Reasoning. Springer, Heidelberg (1983)
Wang, X., Feng, D., Lai, X., Yu, H.: Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive, Report 2004/199 (2004), http://eprint.iacr.org/
Zhang, L., Malik, S.: The quest for efficient Boolean satisfiability solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002, vol. 2404, p. 17. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jovanović, D., Janičić, P. (2005). Logical Analysis of Hash Functions. In: Gramlich, B. (eds) Frontiers of Combining Systems. FroCoS 2005. Lecture Notes in Computer Science(), vol 3717. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11559306_11
Download citation
DOI: https://doi.org/10.1007/11559306_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29051-3
Online ISBN: 978-3-540-31730-2
eBook Packages: Computer ScienceComputer Science (R0)