Combinatorial multicollision attacks on generalized iterated hash functions

Kimmo Halunen, Juha Kortelainen, Tuomas Kortelainen

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

Abstract

We develop a word combinatorial approach to multi-collisions in generalized iterated hash functions. The work rests on the notable discoveries of A. Joux and on generalizations provided by M. Nandi and D. Stin-son as well as J. Hoch and A. Shamir. New results and improvements to some previously published ones are produced. We also wish to unify the diverse notations and bring the results together by applying concepts of combinatorics on words. A multicollision attack method informally described by Hoch and Shamir is presented as a statistical procedure and analyzed in detail.

Original languageEnglish
Title of host publicationProceedings of the 8th Australasian Information Security Conference, AISC 2010
Pages86-93
Number of pages8
Publication statusPublished - 2010
MoE publication typeNot Eligible
Event8th Australasian Information Security Conference, AISC 2010 - Brisbane, Australia
Duration: 19 Jan 201020 Jan 2010

Publication series

SeriesConferences in Research and Practice in Information Technology Series
Volume105
ISSN1445-1336

Conference

Conference8th Australasian Information Security Conference, AISC 2010
Country/TerritoryAustralia
CityBrisbane
Period19/01/1020/01/10

Keywords

  • Iterated hash functions
  • Multicollisions
  • Word combinatorics

Fingerprint

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

Cite this