Variants of multicollision attacks on iterated hash functions

Tuomas Kortelainen; Juha Kortelainen; Kimmo Halunen

doi:10.1007/978-3-642-21518-6_11

Variants of multicollision attacks on iterated hash functions

Tuomas Kortelainen^*, Juha Kortelainen, Kimmo Halunen

^*Corresponding author for this work

Not published at VTT

University of Oulu

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-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·k2^n/2 work one can find greater than 2^k-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 language	English
Title of host publication	Information Security and Cryptology, Inscrypt 2010
Publisher	Springer
Pages	139-154
Number of pages	16
ISBN (Electronic)	978-3-642-21518-6
ISBN (Print)	978-3-642-21517-9
DOIs	https://doi.org/10.1007/978-3-642-21518-6_11
Publication status	Published - 2011
MoE publication type	Not Eligible
Event	6th China International Conference on Information Security and Cryptology, Inscrypt 2010 - Shanghai, China Duration: 20 Oct 2010 → 24 Oct 2010

Publication series

Series	Lecture Notes in Computer Science
Volume	6584
ISSN	0302-9743

Conference

Conference	6th China International Conference on Information Security and Cryptology, Inscrypt 2010
Country/Territory	China
City	Shanghai
Period	20/10/10 → 24/10/10

Access to Document

10.1007/978-3-642-21518-6_11

Cite this

@inproceedings{0fd4d4ba79554ec4898f63c8b48564b9,

title = "Variants of multicollision attacks on iterated hash functions",

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.",

author = "Tuomas Kortelainen and Juha Kortelainen and Kimmo Halunen",

year = "2011",

doi = "10.1007/978-3-642-21518-6_11",

language = "English",

isbn = "978-3-642-21517-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "139--154",

booktitle = "Information Security and Cryptology, Inscrypt 2010",

address = "Germany",

note = "6th China International Conference on Information Security and Cryptology, Inscrypt 2010 ; Conference date: 20-10-2010 Through 24-10-2010",

}

Kortelainen, T, Kortelainen, J & Halunen, K 2011, Variants of multicollision attacks on iterated hash functions. in Information Security and Cryptology, Inscrypt 2010. Springer, Lecture Notes in Computer Science, vol. 6584 , pp. 139-154, 6th China International Conference on Information Security and Cryptology, Inscrypt 2010, Shanghai, China, 20/10/10. https://doi.org/10.1007/978-3-642-21518-6_11

Variants of multicollision attacks on iterated hash functions. / Kortelainen, Tuomas; Kortelainen, Juha; Halunen, Kimmo.
Information Security and Cryptology, Inscrypt 2010. Springer, 2011. p. 139-154 (Lecture Notes in Computer Science, Vol. 6584 ).

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Variants of multicollision attacks on iterated hash functions

AU - Kortelainen, Tuomas

AU - Kortelainen, Juha

AU - Halunen, Kimmo

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79960792127&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-21518-6_11

DO - 10.1007/978-3-642-21518-6_11

M3 - Conference article in proceedings

AN - SCOPUS:79960792127

SN - 978-3-642-21517-9

T3 - Lecture Notes in Computer Science

SP - 139

EP - 154

BT - Information Security and Cryptology, Inscrypt 2010

PB - Springer

T2 - 6th China International Conference on Information Security and Cryptology, Inscrypt 2010

Y2 - 20 October 2010 through 24 October 2010

ER -

Variants of multicollision attacks on iterated hash functions

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this