Provably secure double-block-length hash functions in a black-box model

Lecture Notes in Computer Science

Volumn 3506, Issue , 2005, Pages 330-342

  Hirose, Shoichi ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Black box model; Block cipher; Double block length hash function

Indexed keywords

ALGORITHMS; BLOCK CODES; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS;

BLACK-BOX MODELS; BLOCK CIPHER; COLLISION-FINDING ALGORITHMS; DOUBLE-BLOCK-LENGTH HASH FUNCTIONS;

CRYPTOGRAPHY;

EID: 24944500380     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496618_24     Document Type: Conference Paper

References (19)

1. E. Biham and R. Chen. Near-collisions of SHA-0. Cryptology ePrint Archive, Report 2004/146, 2004. http://eprint.iacr.org/.
2. J. Black, M. Cochran, and T. Shrimpton. On the impossibility of highly efficient blockcipher-based hash functions. Cryptology ePrint Archive, Report 2004/062, 2004. http://eprint.iacr.org/.
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, pages 320-335, 2002. Lecture Notes in Computer Science 2442.
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. I. Damgård. A design principle for hash functions. In CRYPTO'89 Proceedings, pages 416-427, 1990. Lecture Notes in Computer Science 435.
6. M. Hattori, S. Hirose, and S. Yoshida. Analysis of double block length hash functions. In 9th IMA International Conference on Cryptography and Coding, pages 290-302, 2003. Lecture Notes in Computer Science 2898.
7. W. Hohl, X. Lai, T. Meier, and C. Waldvogel. Security of iterated hash functions based on block ciphers. In CRYPTO'93 Proceedings, pages 379-390, 1994. Lecture Notes in Computer Science 773.
8. L. Knudsen and B. Preneel. Hash functions based on block ciphers and quaternary codes. In ASIACRYPT'96 Proceedings, pages 77-90, 1996. Lecture Notes in Computer Science 1163.
9. L. Knudsen and B. Preneel. Fast and secure hashing based on codes. In CRYPTO'97 Proceedings, pages 485-498, 1997. Lecture Notes in Computer Science 1294.
10. 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.
11. L. R. Knudsen, X. Lai, and B. Preneel. Attacks on fast double block length hash functions. Journal of Cryptology, 11(1):59-72, 1998.
12. X. Lai and J. L. Massey. Hash function based on block ciphers. In EUROCRYPT'92 Proceedings, pages 55-70, 1993. Lecture Notes in Computer Science 658.
13. M. Liskov, R. L. Rivest, and D. Wagner. Tweakable block ciphers. In CRYPTO 2002 Proceedings, pages 31-46, 2002. Lecture Notes in Computer Science 2442.
14. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
15. R. C. Merkle. One way hash functions and DES. In CRYPTO'89 Proceedings, pages 428-446, 1990. Lecture Notes in Computer Science 435.
16. B. Preneel, R. Govaerts, and J. Vandewalle. Hash functions based on block ciphers: A synthetic approach. In CRYPTO'95 Proceedings, pages 368-378, 1994. Lecture Notes in Computer Science 773.
17. T. Satoh, M. Haga, and K. Kurosawa. Towards secure and fast hash functions. IEICE Transactions on Fundamentals, E82-A(1):55-62, 1999.
18. X. Wang, D. Feng, X. Lai, and H. Yu. Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD. Cryptology ePrint Archive, Report 2004/199, 2004. http://sprint.iacr.org/.
19. R. S. Winternitz. A secure one-way hash function built from DES. In IEEE Symposium on Security and Privacy, pages 88-90, 1984.