Another Glance at Double-Length Hashing

  • Onur Özen
  • Martijn Stam
Conference paper

DOI: 10.1007/978-3-642-10868-6_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5921)
Cite this paper as:
Özen O., Stam M. (2009) Another Glance at Double-Length Hashing. In: Parker M.G. (eds) Cryptography and Coding. IMACC 2009. Lecture Notes in Computer Science, vol 5921. Springer, Berlin, Heidelberg

Abstract

We propose a novel framework for blockcipher-based double-length hash functions by extending the recent generalization presented by Stam at FSE ’09 for single-call hash functions. We focus on compression functions compressing 3n bits to 2n bits that use one or two calls to a 2n-bit key, n-bit block blockcipher. In case of a single call, we concentrate on security in the iteration. In case of two calls, we restrict ourselves to two parallel calls (initially to distinct and independent blockciphers). We analyse the kind of pre- and postprocessing functions that are sufficient to obtain close to optimal collision resistance, either in the compression function or in the iteration. Our framework can be used to get a clearer understanding of a large class of double-length hash functions of this type.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Onur Özen
    • 1
  • Martijn Stam
    • 1
  1. 1.LACALEPFLSwitzerland

Personalised recommendations