A Framework for Iterative Hash Functions - HAIFA

Eli Biham; Orr Dunkelman

Paper 2007/278

A Framework for Iterative Hash Functions - HAIFA

Eli Biham and Orr Dunkelman

Abstract

Since the seminal works of Merkle and Damgard on the iteration of compression functions, hash functions were built from compression functions using the Merkle-Damgard construction. Recently, several flaws in this construction were identified, allowing for pre-image attacks and second pre-image attacks on such hash functions even when the underlying compression functions are secure. In this paper we propose the HAsh Iterative FrAmework (HAIFA). Our framework can fix many of the flaws while supporting several additional properties such as defining families of hash functions and supporting variable hash size. HAIFA allows for an online computation of the hash function in one pass with a fixed amount of memory independently of the size of the message. Besides our proposal, the recent attacks initiated research on the way compression functions are to be iterated. We show that most recent proposals such as randomized hashing, the enveloped Merkle-Damgard, and the RMC and ROX modes can be all be instantiated as part of the HAsh Iterative FrAmework (HAIFA).

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Merkle-Damgard randomized hashing Enveloped Merkle-Damgard RMC ROX Wide pipe HAIFA
Contact author(s): orr dunkelman @ esat kuleuven be
History: 2007-08-08: last of 2 revisions; 2007-08-07: received; See all versions
Short URL: https://ia.cr/2007/278
License: CC BY

BibTeX

@misc{cryptoeprint:2007/278,
      author = {Eli Biham and Orr Dunkelman},
      title = {A Framework for Iterative Hash Functions - {HAIFA}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2007/278},
      year = {2007},
      url = {https://eprint.iacr.org/2007/278}
}