Multicollision attacks on some generalized sequential hash functions

IEEE Transactions on Information Theory

Volumn 53, Issue 2, 2007, Pages 759-767

  Nandi, Mridul ^a   Stinson, Douglas R ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Birthday attack; Hash function; Multicollision attack

Indexed keywords

FUNCTIONS; ITERATIVE METHODS; SIGNAL PROCESSING;

HASH FUNCTION; MESSAGE DIGEST; MULTICOLLISION ATTACK;

INFORMATION THEORY;

EID: 33847688060     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.889721     Document Type: Article

References (25)

1. E. Brickell, D. Pointcheval, S. Vaudenay, and M. Yung, "Design validations for discrete logarithm based signature schemes," in Public Key Cryptography (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2000, vol. 1751, pp. 276-292.
2. D. Coppersmith, "Another birthday attack," in Advances in Cryptology - CRYPTO '85 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1996, vol. 218, pp. 14-17.
3. I. B. Damgård, "A design principle for hash functions," in Advances in Cryptology - CRYPTO '89 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1990, vol. 435, pp. 416-427.
4. D. W. Davies and W. L. Price, "The application of digital signatures based on public key cryptosystems," in Proc. 5th Int. Computer Communications Conf., Atlanta, GA, Oct. 1980, pp. 525-530.
5. P. Diaconis and F. Mosteller, "Methods for studying coincidences," J. Amer. Statist. Assoc., vol. 84, pp. 853-861, 1989.
6. M. Girault, R. Cohen, and M. Campana, "A generalized birthday attack," in Advances in Cryptology - EUROCRYPT '88 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1988, vol. 330, pp. 129-157.
7. M. Girault and J. Stern, "On the length of cryptographic hash-values used in identification schemes," in Advances in Cryptology - RYPTO '94 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1994, vol. 839, pp. 202-215.
8. M. Hattori, S. Hirose, and S. Yoshida, "Analysis of double block length hash functions," in Cryptography and Coding, 2003 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2003, vol. 2898, pp. 290-302.
9. S. Hirose, "Provably secure double-block-length hash functions in a black-box model," in Information Security and Cryptology - ICISC 2004 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2005, vol. 3506, pp. 330-342.
10. J. J. Hoch and A. Shamir, "Breaking the ICE - Finding multicollisions in iterated concatenated and expanded (ICE) hash functions," in Fast Software Encryption 2006 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2006, vol. 4047, pp. 179-194.
11. A. Joux, "Multicollisions in iterated hash functions. Application to cascaded constructions," in Advances in Cryptology - CRYPTO 2004 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2004, vol. 3152, pp. 306-316.
12. n work," in Advances in Cryptology - EUROCRYPT 2005 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2005, vol. 3494, pp. 474-490.
13. L. Knudsen, X. Lai, and B. Preneel, "Attacks on fast double block length hash functions," J. Cryptol., vol. 11, pp. 59-72, 1998.
14. L. Knudsen and B. Preneel, "Construction of secure and fast hash functions using nonbinary error-correcting codes," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2524-2539, Sep. 2002.
15. S. Lucks, Design Principles for Iterated Hash Functions, IACR Cryptology ePrint Archive [Online]. Available: http://eprint.iacr.org/2004/253
16. A. J. Menezes, P. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL: CRC, 1996.
17. R. Merkle, "One way hash functions and DES," in Advances in Cryptology - CRYPTO '89 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1990, vol. 435, pp. 428-446.
18. M. Nandi, "Design of Iteration on hash functions and its cryptanalysis," Ph.D. dissertation, Indian Statistical Institute, Kolkata, India, 2005.
19. M. Nandi and D. R. Stinson, Multicollision Attacks on Generalized Hash Functions, IACR Cryptology ePrint Archive [Online]. Available: http://eprint.iacr.org/2004/330
20. B. Preneel, "Analysis and Design of Cryptographic Hash Functions, D," Ph.D. dissertation, Katholieke Universiteit Leuven, Leuven, Belgium, 1993.
21. R. Rivest and A. Shamir, "PayWord and MicroMint," CryptoBytes, vol. 2, no. 1, pp. 7-11, 1996.
22. P. Sarkar, Domain Extender for Collision Resistant Hash Functions: Improving Upon Merkle-Damgård Iteration, IACR Cryptology ePrint Archive [Online]. Available: http://eprint.iacr.org/2003/173
23. T. Satoh, M. Haga, and K. Kurosawa, "Toward secure and fast hash functions," IEICE Trans. Fund. Electron., Commun. Comp. Sci., vol. E82-A, no. 1, pp. 55-62, 1999.
24. D. R. Stinson, Cryptography: Theory and Practice, Third ed. Boca Raton, FL: CRC, 2006.
25. D. R. Stinson, "Some observations on the theory of cryptographic hash functions," Des., Codes Cryptogr., vol. 38, pp. 259-277, 2006.