Fast Software Encryption

Volume 5086 of the series Lecture Notes in Computer Science pp 36-53

The Hash Function Family LAKE

  • Jean-Philippe AumassonAffiliated withFHNW
  • , Willi MeierAffiliated withFHNW
  • , Raphael C. -W. PhanAffiliated withElectronic & Electrical Engineering, Loughborough University


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.


Hash function HAIFA Randomized hashing Salt Wide-pipe