Multicollisions and graph-based hash functions

Kimmo Halunen

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

1 Citation (Scopus)


In this paper, we present some generalisations of previous multicollision finding methods and apply these against a new type of tree-based hash functions. We also show that the very general class of hash functions first presented by Nandi and Stinson can be understood as graph-based hash functions and a graph theoretical approach can be utilised in studying their properties. Previously, an efficient multicollision attack has been found against the basic iterated hash function construction. This method has been applied to the generalised iterated hash functions and binary tree-based hash functions. We show that similar methods can be utilised also against t-ary tree-based hash functions, simplify some definitions and conjecture a similar result for multicollisions against graph-based hash functions.

Original languageEnglish
Title of host publicationTrusted Systems, Intrust 2011
EditorsL. Cheng, M. Yung, L. Zhu
Number of pages12
ISBN (Electronic)978-3-642-32298-3
ISBN (Print)978-3-642-32297-6
Publication statusPublished - 2012
MoE publication typeNot Eligible
Event3rd International Conference on Trusted Systems, INTRUST 2011 - Beijing, China
Duration: 27 Nov 201129 Nov 2011

Publication series

SeriesLecture Notes in Computer Science


Conference3rd International Conference on Trusted Systems, INTRUST 2011


  • graphs
  • hash functions
  • multicollisions

Fingerprint Dive into the research topics of 'Multicollisions and graph-based hash functions'. Together they form a unique fingerprint.

Cite this