Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers

  • Authors:
  • Phillip Rogaway;John Steinberger

  • Affiliations:
  • Department of Computer Science, University of California, Davis, USA;Department of Mathematics, University of British Columbia, Canada

  • Venue:
  • CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions have security approaching and in many cases equaling the security upper bounds found in previous work of the authors [24]. In particular, we describe a 2n-bit to n-bit compression function using three n-bit permutation calls that has collision security N0.5, where N= 2n, and we describe 3n-bit to 2n-bit compression functions using five and six permutation calls and having collision security of at least N0.55and N0.63.