Some Plausible Constructions of Double-Block-Length Hash Functions

  • Shoichi Hirose
Conference paper

DOI: 10.1007/11799313_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4047)
Cite this paper as:
Hirose S. (2006) Some Plausible Constructions of Double-Block-Length Hash Functions. In: Robshaw M. (eds) Fast Software Encryption. FSE 2006. Lecture Notes in Computer Science, vol 4047. Springer, Berlin, Heidelberg


In this article, it is discussed how to construct a compression function with 2 n-bit output using a component function with n-bit output. The component function is either a smaller compression function or a block cipher. Some constructions are presented which compose collision-resistant hash functions: Any collision-finding attack on them is at most as efficient as the birthday attack in the random oracle model or in the ideal cipher model. A new security notion is also introduced, which we call indistinguishability in the iteration, with a construction satisfying the notion.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Shoichi Hirose
    • 1
  1. 1.Faculty of EngineeringThe University of FukuiFukuiJapan

Personalised recommendations