Multicollision Attacks on some Generalized Sequential Hash Functions

M.  Nandi; D.  R.  Stinson

Paper 2006/055

Multicollision Attacks on some Generalized Sequential Hash Functions

M. Nandi and D. R. Stinson

Abstract

A multicollision for a function is a set of inputs whose outputs are all identical. A. Joux showed multicollision attacks on the classical iterated hash function. He also showed how these multicollision attacks can be used to get a collision attack on a concatenated hash function. In this paper, we study multicollision attacks in a more general class of hash functions which we term ``generalized sequential hash functions''. We show that multicollision attacks exist for this class of hash functions provided that every message block is used at most twice in the computation of the message digest.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Published elsewhere. unpublished, currently submitted for publication
Keywords: hash functions
Contact author(s): dstinson @ uwaterloo ca
History: 2006-02-14: received
Short URL: https://ia.cr/2006/055
License: CC BY

BibTeX

@misc{cryptoeprint:2006/055,
      author = {M.  Nandi and D.  R.  Stinson},
      title = {Multicollision Attacks on some Generalized Sequential Hash Functions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/055},
      year = {2006},
      url = {https://eprint.iacr.org/2006/055}
}