International Workshop on Fast Software Encryption

FSE 2008: Fast Software Encryption pp 36-53

The Hash Function Family LAKE

  • Jean-Philippe Aumasson
  • Willi Meier
  • Raphael C. -W. Phan
Conference paper

DOI: 10.1007/978-3-540-71039-4_3

Volume 5086 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Aumasson JP., Meier W., Phan R.C.W. (2008) The Hash Function Family LAKE. In: Nyberg K. (eds) Fast Software Encryption. FSE 2008. Lecture Notes in Computer Science, vol 5086. Springer, Berlin, Heidelberg

Abstract

This paper advocates a new hash function family based on the HAIFA framework, inheriting built-in randomized hashing and higher security guarantees than the Merkle-Damgård construction against generic attacks. The family has as its special design features: a nested feedforward mechanism and an internal wide-pipe construction within the compression function. As examples, we give two proposed instances that compute 256- and 512-bit digests, with a 8- and 10-round compression function respectively.

Keywords

Hash functionHAIFARandomized hashingSaltWide-pipe
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jean-Philippe Aumasson
    • 1
  • Willi Meier
    • 1
  • Raphael C. -W. Phan
    • 2
  1. 1.FHNWWindischSwitzerland
  2. 2.Electronic & Electrical EngineeringLoughborough UniversityUnited Kingdom