Variants of multicollision attacks on iterated hash functions

Authors:
Tuomas Kortelainen;Juha Kortelainen;Kimmo Halunen
Affiliations:
Mathematics Division, Department of Electrical and Information Engineering, University of Oulu;Department of Information Processing Science, University of Oulu;Oulu University Secure Programming Group, Department of Electrical and Information Engineering, University of Oulu
Venue:
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Year:
2010

Citing 11
Cited 1

Handbook of Applied Cryptography

Handbook of Applied Cryptography
A Design Principle for Hash Functions

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
How Easy is Collision Search. New Results and Applications to DES

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
One Way Hash Functions and DES

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Faster Multicollisions

INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Birthday Paradox for Multi-Collisions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Second preimage attacks on dithered hash functions

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Breaking the ICE – finding multicollisions in iterated concatenated and expanded (ICE) hash functions

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
Second preimages on n-bit hash functions for much less than 2n work

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Herding hash functions and the nostradamus attack

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Multicollision Attacks on Some Generalized Sequential Hash Functions

IEEE Transactions on Information Theory

Multicollisions and graph-based hash functions

INTRUST'11 Proceedings of the Third international conference on Trusted Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce a statistical experiment setting to carry out a multicollision attack on any iterated hash function. We develop a method for finding multicollisions that gives larger multicollision sets for the same amount of work as Joux's famous method i.e. with 2.5ċk2n/2 work one can find greater than 2k-collisions for large k. Furthermore, if the message length is not restricted, we show that we can create arbitrarily large multicollisions by finding two cycles in the iterated hash function. This applies even when an ideal compression function is used.