The collision intractability of MDC-2 in the ideal-cipher model

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

Volumn 4515 LNCS, Issue , 2007, Pages 34-51

  Steinberger, John P ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Collision resistant hashing; Cryptographic hash functions; Ideal cipher model; MDC 2

Indexed keywords

BINARY SEQUENCES; BLOCK CODES; COLLISION AVOIDANCE; CRYPTOGRAPHY; QUERY PROCESSING;

COLLISION RESISTANT HASH-FUNCTIONS; CRYPTOGRAPHIC HASH FUNCTIONS; IDEAL CIPHER MODELS; MDC-2;

SECURITY OF DATA;

EID: 38049103279     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_3     Document Type: Conference Paper

References (32)

1. ANSI X9.31. Public key cryptography using reversible algorithms for the financial services industry. American National Standards Institute, 1998.
2. B. den. Boer and A. Bosselaers. Collisions for the compression function of MD5. Advances in Cryptology - EUROCRYPT '93, Lecture Notes in Computer Science, vol. 765, Springer, pp. 293-304, 1993.
3. J. Black, M. Cochran, and T. Shrimpton. On the impossibility of highly efficient blockcipher-based hash functions. Advances in Cryptology - EUROCRYPT '05, Lecture Notes in Computer Science, vol. 3494, Springer, pp.-546-541, 2005.
4. J. Black, P. Rogaway, and T. Shrimpton. Black-box analysis of the blockcipher-based hash-function constructions from PGV. Advances in Cryptology - CRYPTO '02, Lecture Notes in Compuer Science, vol. 2442, Springer, pp. 320-355, 2002.
5. B. Brachtl, D. Coppersmith, M. Hyden, S. Matyas, C. Meyer, J. Oseas, S. Pilpel, and M. Schilling. Data authentication using modification detection codes based on a public one-way encryption function. US Patent #4,908,861. Awarded March 13, 1990 (filed Auguest 28, 1987).
6. I. Damgård. A design principle for hash functions. Advances in Cryptology - CRYPTO '89, Lecture Notes in Computer Science, vol. 435, Springer, pp. 416-427, 1990.
7. H. Dobbertin. The status of MD5 after a recent attack. CryptoBytes 2 (2), 1996.
8. S. Even and Y. Mansour. A construction of a cipher from a single pseudorandom permutation. Advances in Cryptology - ASIACRYPT '91, Lecture Notes in Computer Science, vol. 739, Springer, pp. 210-224, 1991.
9. M. Hattori, S. Hirose, and S. Yoshida. Analysis of double block lengh hash functions. Cryptography and Coding, 9th IMA International Conference, Lecture Notes in Computer Science, vol. 2898, Springer, pp. 290-302, 2003.
10. S. Hirose. Provably secure double-block-length hash functions in a black box model. Information Security and Cryptology - ISISC '04, Lecture Notes in Computer Science, vol. 3506, Springer, pp. 330-342, 2005.
11. S. Hirose. Some plausible constructions of double-block-length hash functions. Fast Software Encryption (FSE '06). Lecture Notes in Computer Science, vol. 4047, Springer, pp. 210-225, 2005.
12. W. Hohl, X. Lai, T. Meier, and C. Waldvogel. Security of iterated hash functions based on block ciphers. Advances in Cryptology - CRYPTO '93. Lecture Notes in Computer Science, vol. 773, Springer, pp. 303-311, 1993.
13. ISO/IEC 10118-2:2000. Information technology - Security techniques - Hash functions - Hash functions using an n-bit block cipher. International Organization for Standardization, Geneva, Switzerland, 2000. First released in 1992.
14. A. Joux. Multicollisions in iterated hash functions, applications to cascaded constructions. Advances in Cryptology - CRYPTO '04. Lecture Notes in Computer Science, vol. 3152, Springer, pp. 306-316, 2004.
15. J. Kilian and P. Rogaway. How to Protect DES Against Exhaustive Key Search. Journal of Cryptology, vol. 14, no. 1, pp. 17-35, 2001.
16. L. Knudsen, X. Lai, and B. Preneel. Attacks on fast double block length hash functions. Journal of Cryptology, vol. 11, no. 1, pp. 59-72, 1998.
17. X. Lai and J. Massey. Hash functions based on block ciphers. Advances in Cryptology - EUROCRYPT '92. Lecture Notes in Computer Science, vol. 658, Springer, pp. 55-70, 1992.
18. W. Lee, M. Nandi, P. Sarkar, D. Chang, S. Lee, and K. Sakurai. PGV-style blockcipher-based hash families and black-box analysis. IEICE Transactions 88-A(1), pp. 39-48, 2005.
19. S. Lucks. Design principles for iterated hash functions. Cryptology ePrint Archive, Report 2004/253, 2004.
20. S. Matyas, C. Meyer, and J. Oseas. Generating strong one-way functions with cryptographic algorithm. IBM Technical Disclosure Bulletin, 27, pp. 5658-5659, 1985.
21. R. Merkle. One way hash functions and DES. Advances in Cryptology - CRYPTO '89. Lecture Notes in Computer Science, vol. 435, Springer, pp. 428-446, 1990.
22. C. Meyer and S. Matyas. Secure program load with manipulation detection code. Proceedings of the 6th Worldwide Congress on Computer and Communications Security and Protection (SECURICOM '88), pp. 111-130, 1988.
23. M. Nandi, W. Lee, K. Sakurai, and S. Lee. Security analysis of a 2/3-rate double length compression function in the black-box model. Fast Software Encryption (FSE '05), Lecture Notes in Computer Science, vol. 3557, pp. 243-254, 2005.
24. M. Nandi. Towards optimal double-length hash functions. Progress in Cryptography - INDOCRYPT '05, Lecture Notes in Computer Science, vol. 3797, Springer, pp. 77-89, 2005.
25. M. Rabin. Digitalized signatures. In R. DeMillo, D. Dobkin, A. Jones, and R. Lipton, editors, Foundations of Secure Computation, Academic Press, pp. 155-168, 1978.
26. R. Rivest. The MD4 message digest algorithm. Advances in Cryptology - CRYPTO '90, Lecture Notes in Comptuer Science, vol. 537, pp. 303-311, 1991.
27. P. Rogaway and T. Shrimpton. Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision Resistance. Fast Software Encryption (FSE '04), Lecture Notes in Computer Science, vol. 3017, pp. 371-388, Springer, vol. 3017, 2004.
28. T. Satoh, M. Haga, and K. Kurosawa. Towards secure and fast hash functions. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E82-A No. 1, pp. 55-62.
29. J. Steinberger. The collision intractability of MDC-2 in the ideal-cipher model. Full version of this paper. Cryptology ePrint Archive, Report 2006/294, 2006.
30. J. Viega. The AHASH mode of operation. Manuscript, 2004. Available from www.cryptobarn.com.
31. X. Wang, X. Lai, D. Feng, H. Chen, and X. Yu. Cryptanalysis of the hash functions MD4 and RIPEMD. Advances in Cryptology - EUROCRYPT '05, Lecture Notes in Computer Science, vol. 3494, Springer, pp. 1-18. 2005.
32. X. Wang, Y. Yin, and H. Yu. Finding collisions in the full SHA-1. Advances in Cryptology - CRYPTO '05, Lecture Notes in Computer Science, vol. 3621, Springer, pp. 17-36, 2005.