Variants of multicollision attacks on iterated hash functions

Tuomas Kortelainen, Juha Kortelainen, Kimmo Halunen

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationInformation Security and Cryptology, Inscrypt 2010
PublisherSpringer
Pages139-154
Number of pages16
ISBN (Electronic)978-3-642-21518-6
ISBN (Print)978-3-642-21517-9
DOIs
Publication statusPublished - 2011
MoE publication typeNot Eligible
Event6th China International Conference on Information Security and Cryptology, Inscrypt 2010 - Shanghai, China
Duration: 20 Oct 201024 Oct 2010

Publication series

SeriesLecture Notes in Computer Science
Volume6584
ISSN0302-9743

Conference

Conference6th China International Conference on Information Security and Cryptology, Inscrypt 2010
CountryChina
CityShanghai
Period20/10/1024/10/10

Fingerprint Dive into the research topics of 'Variants of multicollision attacks on iterated hash functions'. Together they form a unique fingerprint.

  • Cite this

    Kortelainen, T., Kortelainen, J., & Halunen, K. (2011). Variants of multicollision attacks on iterated hash functions. In Information Security and Cryptology, Inscrypt 2010 (pp. 139-154). Springer. Lecture Notes in Computer Science, Vol.. 6584 https://doi.org/10.1007/978-3-642-21518-6_11