Combining compression functions and block cipher-based hash functions

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

Volumn 4284 LNCS, Issue , 2006, Pages 315-331

  Peyrin, Thomas ^a   Gilbert, Henri ^a   Muller, Frédéric ^b   Robshaw, Matt ^a  

^a ORANGE LABS   (France)

^b HSBC Halbis Partners   (France)

Author keywords

Block ciphers; Compression functions; Hash functions

Indexed keywords

BLOCK CIPHERS; COMPRESSION FUNCTIONS; IMPOSSIBILITY RESULTS;

LYAPUNOV METHODS; NETWORK SECURITY;

HASH FUNCTIONS;

EID: 38149022185     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935230_21     Document Type: Conference Paper

References (40)

1. M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In ACM Conference on Computer and Communications Security, pages 62-73. 1993.
2. J. Black, P. Rogaway, and T. Shrimpton. Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV. In M. Ynng, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 320-335. Springer-Verlag, 2002.
3. J. Black, M. Cochran, and T. Shrimpton. On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions. In R. Cramer, editor, Advances in Cryptology - EUROCRYPT '05, volume 3494 of Lecture Notes in Computer Science, pages 526-541. Springer-Verlag, 2005.
4. L. Brown, J. Pieprzyk, and J. Seberry. LOKI - a Cryptographic Primitive for Authentication and Secrecy Applications. In J. Pieprzyk and J. Seberry, editors, Advances in Cryptology - A USCRYFT '.90, volume 453 of Lecture Notes in Computer Science, pages 229-236. Springer-Verlag, 1990.
5. D. Coppersmith, S. Pilpel, C.H. Meyer, SM. Matyas, M.M. Hyden, J. Oseas, B. Brachtl, and M. Schilling. Data Authentication Using Modification Dectection Codes Based on a Public One Way Encryption Function. U.S. Patent No. 4,908,861, March 13, 1990.
6. J-S. Coron, Y. Dodis, C. Malinaud, and P. Puniya. Merkle-Damgård Revisited: How to Construct a Hash Function. In V. Shoup, editor, Advances in Cryptology - CRYPTO 2005, volume 3621 of Lecture Notes in Computer Science, pages 430-448. Springer-Verlag, 2005.
7. I. Damgård. A Design Principle for Hash Functions. In G. Brassard, editor, Advances in Cryptology - CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 416-427. Springer-Verlag, 1989.
8. R.D. Dean. Formal Aspects of Mobile Code Security. PhD thesis, Princeton University, 1999.
9. H. Handschuh, L.R. Knudsen, and M.J.B. Robshaw. Analysis of SHA-1 in Encryption Mode. In D. Naccache, editor, Topics in Cryptology - CT-RSA 2001, volume 2020 of Lecture Notes in Computer Science, pages 70-83. Springer-Verlag, 2001.
10. S. Hirose. Provably Secure Double-block-length Hash Functions in a Black-box Model. In C. Park and S. Chee, editors, Information Security and Cryptology - ICISC 2004, volume 3506 of Lecture Notes in Computer Science, pages 330-342. Springer-Verlag, 2004.
11. S. Hirose. Some Plausible Constructions of Double-Block-Length Hash Functions. In M.J.B. Robshaw, editor, Fast Software Encryption - FSE 2006, volume 4047 of Lecture Notes in Computer Science.
12. A. Joux. Multi-collisions in Iterated Hash Functions. Application to Cascaded Constructions. In M. Franklin, editor, Advances in Cryptology - CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 306-316. Springer-Verlag, 2004.
13. n Work. In R. Cramer, editor, Advances in Cryptology - EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, pages 474-490. Springer-Verlag, 2005.
14. L.R. Knudsen and X. Lai. New Attacks on All Double Block Length Hash Functions of Hash Rate 1, Including the Parallel-DM. In A. De Santis, editor, Advances in Cryptology - EUROCRYPT '94, volume 950 of Lecture Notes in Computer Science, pages 410-418. Springer-Verlag, 1994.
15. L.R. Knudsen and F. Muller. Some Attacks Against a Double Length Hash Proposal. In B. Roy, editor, Advances in Cryptology - ASIA CRYPT '05, volume 3788 of Lecture Notes in Computer Science, pages 462-473. Springer-Verlag, 2005.
16. L.R. Knudsen and B. Preneel. Hash Functions Based on Block Ciphers and Quaternary Codes. In K. Kim and T. Matsumoto, editors, Advances in Cryptology - ASIA CRYPT '96, volume 1163 of Lecture Notes in Computer Science, pages 77-90. Springer-Verlag, 1996.
17. L.R. Knudsen and B. Preneel. Fast and Secure Hashing Based on Codes. In B.S. Kaliski Jr., editor, Advances in Cryptology - CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 485-498. Springer-Verlag, 1997.
18. L.R. Knudsen and B. Preneel. Construction of Secure and Fast Hash Functions Using Nonbinary Error-Correcting Codes. IEEE Transactions on Information Theory, 48(9):2524-2539, 2002.
19. X. Lai and J.L. Massey. Hash Functions Based on Block Ciphers. In R. A. Rueppel, editor, Advances in Cryptology - EUROCRYPT '92, volume 658 of Lecture Notes in Computer Science, pages 55-70. Springer-Verlag, 1992.
20. X. Lai, J.L. Massey, and S. Murphy. Markov Ciphers and Differential Cryptanalysis. In D.W. Davies, editor, Advances in Cryptology - EUROCRYPT '91, volume 547 of Lecture Notes in Computer Science, pages 17-38. Springer-Verlag, 1991.
21. X. Lai, C. Waldvogel, W. Hohl, and T. Meier. Security of Iterated Hash Functions Based on Block Ciphers. In D.R. Stinson, editor, Advances in Cryptology - CRYPTO '93, volume 773 of Lecture Notes in Computer Science, pages 379-390. Springer-Verlag, 1993.
22. S. Lucks. A Failure-Friendly Design Principle for Hash Functions. In B. Roy, editor, Advances in Cryptology - ASIA CRYPT 2005, volume 3788 of Lecture Notes in Computer Science, pages 474-494. Springer-Verlag, 2005.
23. M. Liskov, R.L. Rivest, and D. Wagner. Tweakable Block Ciphers. In M. Yung, editor, Advances in Cryptology - CRYPTO '02, volume 2442 of Lecture Notes in Computer Science, pages 31-46. Springer-Verlag, 2002.
24. R. Matsumoto, K. Kurosawa, and T. Itoh. Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography. IACR Cryptology ePrint Archive, Report 2005/194. Available from: http://eprint.iacr.org.
25. W. Meier and 0. Staffelbach. Nonlinearity Criteria for Cryptographic Functions. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology - EURO-CRYPT '89, volume 434 of Lecture Notes in Computer Science, pages 549-562. Springer-Verlag, 1989.
26. A.J. Menezes, S.A. Vanstone, and P.C. Van Oorschot. Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton, FL, USA, 1996.
27. R.C. Merkle. One Way Hash Functions and DES. In G. Brassard, editor, Advances in Cryptology - CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 428-446. Springer-Verlag, 1989.
28. M. Nandi, W. Lee, K. Sakurai, and S. Lee. Security Analysis of a 2/3-rate Double Length Compression Function in Black-box Model. In H. Gilbert and H. Handschuh, editors, Fast Software Encryption - FSE 2005, volume 3557 of Lecture Notes in Computer Science, pages 243-254. Springer-Verlag, 2005.
29. National Institute of Standards and Technology. FIPS 197: Advanced Encryption Standard, November 2001 . Available from: http://csrc.nist.gov.
30. National Institute of Standards and Technology. FIPS 180-2: Secure Hash Standard, Angust 2002 . Available from: http://csrc.nist.gov.
31. National Insitute of Standards and Technology. 5P800-67: Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher, May 2004 . Available from: http: //csrc nist gov.
32. B. Preneel. Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Lenven, 1993.
33. B. Preneel, A. Bosselaers, R. Govaerts, and J. Vandewalle. Collision-free Hash Functions Based on Block Cipher Algorithms. In Proceedings 1.98.9 International Carnahan Conference on Security Technology (Oct 9-5 1989: Zurich, Switzerland), pages 203-210. IEEE, 1989. IEEE catalog nnmber 89CH2774-8.
34. B. Preneel, R. Govaerts, and J. Vandewalle. Hash Functions Based on Block Ciphers: A Synthetic Approach. In D.R. Stinson, editor, Advances in Cryptology - CRYPTO '93, volume 773 of Lecture Notes in Computer Science, pages 368-378. Springer-Verlag, 1993.
35. J.-J. Qnisquater and M. Girault. 2n-bit Hash-functions Using n-bit Symmetric Block Cipher Algorithms. In J.-J. Quisquater and J. Vandewalle, editors, Advances in Cryptology - EUROCRYPT '89, volume 434 of Lecture Notes in Computer Science, pages 102-109. Springer-Verlag, 1989.
36. B. Preneel, R. Govaerts, and J. Vandewalle. On the Power of Memory in the Design of Collision Resistant Hash Functions. In J. Seberry and Y. Zheng, editors, Advances in Cryptology - ASIA CRYPT '92, volume 718 of Lecture Notes in Computer Science, pages 105-121. Springer-Verlag, 1992.
37. Ronald L. Rivest. RFC 1321: The MD5 Message-Digest Algorithm, April 1992. Available from: http://www.ietf.org/rfc/rfc1321.txt.
38. D. Wagner. A Generalized Birthday Problem. In M. Yung, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 288-303. Springer-Verlag, 2002.
39. X. Wang and H. Yu. How to Break MD5 and Other Hash Functions. In R. Cramer, editor, Advances in Cryptology - EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, pages 19-35. Springer-Verlag, 2005.
40. X. Wang, Y.L. Yin, and H. Yu. Finding Collisions in the Full SHA-1. In V. Shoup, editor, Advances in Cryptology - CRYPTO 2005, volume 3621 of Lecture Notes in Computer Science, pages 17-36. Springer-Verlag, 2005.