Some plausible constructions of double-block-length hash functions

  • Authors:
  • Shoichi Hirose

  • Affiliations:
  • Faculty of Engineering, The University of Fukui, Fukui, Japan

  • Venue:
  • FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.