Some plausible constructions of double-block-length hash functions

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

Volumn 4047 LNCS, Issue , 2006, Pages 210-225

  Hirose, Shoichi ^a  

^a UNIVERSITY OF FUKUI   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL MODELS; RELATIONAL DATABASE SYSTEMS; SECURITY OF DATA;

COLLISION-RESISTANT HASH FUNCTIONS; DOUBLE-BLOCK-LENGTH HASH FUNCTIONS; RANDOM ORACLE MODEL;

FUNCTIONS;

EID: 33746721457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11799313_14     Document Type: Conference Paper

References (26)

1. J. Black. The ideal-cipher model, revisited: An uninstantiable blockcipher-based hash function. Cryptology ePrint Archive, Report 2005/210, 2005. http://eprint.iacr.org/. Also appear in this proceedings.
2. J. Black, M. Cochran, and T. Shrimpton. On the impossibility of highly efficient blockcipher-based hash functions. In EUROCRYPT 2005 Proceedings, Lecture Notes in Computer Science 3494, pages 526-541, 2005.
3. J. Black, P. Rogaway, and T. Shrimpton. Black-box analysis of the block-cipher-based hash-function constructions from PGV. In CRYPTO 2002 Proceedings, Lecture Notes in Computer Science 2442, pages 320-335, 2002.
4. B. O. Brachtl, D. Coppersmith, M. M. Hyden, S. M. Matyas Jr., C. H. W. Meyer, J. Oseas, S. Pilpel, and M. Schilling. Data authentication using modification detection codes based on a public one-way encryption function, mar 1990. U. S. Patent # 4,908,861.
5. J.-S. Coron, Y. Dodis, C. Malinaud, and P. Puniya. Merkle-damgård revisited: How to construct a hash function. In CRYPTO 2005 Proceedings, Lecture Notes in Computer Science 3621, pages 430-448, 2005.
6. I. Damgård. Collision free hash functions and public key signature schemes. In EUROCRYPT '87 Proceedings, Lecture Notes in Computer Science 304, pages 203-216, 1988.
7. P. Gauravaram, W. Millan, and L. May. CRUSH: A new cryptographic hash function using iterated halving technique. In Proceedings of Cryptographic Algorithms and their Uses 2004, pages 28-39, 2004.
8. M. Hattori, S. Hirose, and S. Yoshida. Analysis of double block length hash functions. In Proceedings of the 9th IMA International Conference on Cryptography and Coding, Lecture Notes in Computer Science 2898, pages 290-302, 2003.
9. S. Hirose. Secure block ciphers are not sufficient for one-way hash functions in the Preneel-Govaerts-Vandewalle model. In Proceedings of the 9th Selected Areas in Cryptography (SAC 2002), Lecture Notes in Computer Science 2595, pages 339-352, 2002.
10. S. Hirose. Provably secure double-block-length hash functions in a black-box model. In Proceedings of the 7th Internatinal Conference on Information Security and Cryptology (ICISC 2004), Lecture Notes in Computer Science 3506, pages 330-342, 2005.
11. W. Hohl, X. Lai, T. Meier, and C. Waldvogel. Security of iterated hash functions based on block ciphers. In CRYPTO '93 Proceedings, Lecture Notes in Computer Science 773, pages 379-390, 1994.
12. L. Knudsen and F. Muller. Some attacks against a double length hash proposal. In ASIACRYPT 2005 Proceedings, Lecture Notes in Computer Science 3788, pages 462-473, 2005.
13. L. Knudsen and B. Preneel. Hash functions based on block ciphers and quaternary codes. In ASIACRYPT '96 Proceedings, Lecture Notes in Computer Science 1163, pages 77-90, 1996.
14. L. Knudsen and B. Preneel. Fast and secure hashing based on codes. In CRYPTO '97 Proceedings, Lecture Notes in Computer Science 1294, pages 485-498, 1997.
15. L. 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.
16. L. R. Knudsen, X. Lai, and B. Preneel. Attacks on fast double block length hash functions. Journal of Cryptology, 11(1):59-72, 1998.
17. X. Lai and J. L. Massey. Hash function based on block ciphers. In EUROCRYPT '92 Proceedings, Lecture Notes in Computer Science 658, pages 55-70, 1993.
18. S. Lucks. A failure-friendly design principle for hash functions. In ASIACRYPT 2005 Proceedings, Lecture Notes in Computer Science 3788, pages 474-494, 2005.
19. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
20. R. C. Merkle. One way hash functions and DES. In CRYPTO '89 Proceedings, Lecture Notes in Computer Science 435, pages 428-446, 1990.
21. M. Nandi. Design of Iteration on Hash Functions and Its Cryptanalysis. PhD thesis, Indian Statistical Institute, 2005.
22. M. Nandi. Towards optimal double-length hash functions. In Proceedings of the 6th International Conference on Cryptology in India (INDOCRYPT 2005), Lecture Notes in Computer Science 3797, pages 77-89, 2005.
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. In Proceedings of the 12th Fast Software Encryption (FSE 2005), Lecture Notes in Computer Science 35571, pages 243-254, 2005.
24. N. Pramstaller and V. Rijmen. A collision attack on a double-block-length hash proposal. Cryptology ePrint Archive, Report 2006/116, 2006. http://eprint.iacr.org/.
25. B. Preneel, R. Govaerts, and J. Vandewalle. Hash functions based on block ciphers: A synthetic approach. In CRYPTO '93 Proceedings, Lecture Notes in Computer Science 773, pages 368-378, 1994.
26. T. Satoh, M. Haga, and K. Kurosawa. Towards secure and fast hash functions. IEICE Transactions on Fundamentals, E82-A(1):55-62, 1999.