Difference between revisions of "LAKE"

Revision as of 15:41, 3 November 2008

Florian Mendel, Martin Schl\"affer - Collisions for Round-Reduced LAKE

ACISP 5107:267-281,2008

Author : Florian Mendel, Martin Schl\"affer
Title : Collisions for Round-Reduced LAKE
In : ACISP -
Address :
Date : 2008

@@ Line 4: / Line 4: @@
 * max. message length: < 2<sup>64</sup> bits
 * compression function: 512-bit message block, 512,1024-bit chaining variable
 * Specification:
+<bibtex>
+@inproceedings{fseAumassonMP08,
+  author    = {Jean-Philippe Aumasson and Willi Meier and Raphael C.-W. Phan},
+  title     = {The Hash Function Family LAKE},
+  booktitle = {FSE},
+  year      = {2008},
+  pages     = {36-53},
+  url       = {http://dx.doi.org/10.1007/978-3-540-71039-4_3},
+  editor    = {Kaisa Nyberg},
+  publisher = {Springer},
+  series    = {LNCS},
+  volume    = {5086},
+  isbn      = {978-3-540-71038-7},
+  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-Damgard 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.},
+}
 == Cryptanalysis ==