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

Hash functions
Hash Function
Attack
Compression Function
Large Set
Collision
Cycle
Experiment
Experiments

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
Kortelainen, Tuomas ; Kortelainen, Juha ; Halunen, Kimmo. / Variants of multicollision attacks on iterated hash functions. Information Security and Cryptology, Inscrypt 2010. Springer, 2011. pp. 139-154 (Lecture Notes in Computer Science, Vol. 6584 ).
@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",

}

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 proceedingConference article in proceedingsScientificpeer-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

ER -

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