Difference between revisions of "LAKE"
From The ECRYPT Hash Function Website
Mschlaeffer (talk | contribs) (→Specification) |
(→Best Known Results) |
||
| (3 intermediate revisions by one other user not shown) | |||
| Line 5: | Line 5: | ||
* compression function: 512-bit message block, 512,1024-bit chaining variable | * compression function: 512-bit message block, 512,1024-bit chaining variable | ||
* Specification: | * Specification: | ||
| + | |||
<bibtex> | <bibtex> | ||
@inproceedings{fseAumassonMP08, | @inproceedings{fseAumassonMP08, | ||
| Line 20: | Line 21: | ||
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.}, | 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.}, | ||
} | } | ||
| + | </bibtex> | ||
== Cryptanalysis == | == Cryptanalysis == | ||
| Line 25: | Line 27: | ||
=== Best Known Results === | === Best Known Results === | ||
| + | |||
| + | Collision Attack for LAKE-256 reduced to 4 (out of 8) rounds with complexity of 2<sup>109</sup>. | ||
---- | ---- | ||
Latest revision as of 16:47, 3 November 2008
Contents
1 Specification
- digest size: 256,512 bits
- max. message length: < 264 bits
- compression function: 512-bit message block, 512,1024-bit chaining variable
- Specification:
Jean-Philippe Aumasson, Willi Meier, Raphael C.-W. Phan - The Hash Function Family LAKE
- FSE 5086:36-53,2008
- http://dx.doi.org/10.1007/978-3-540-71039-4_3
BibtexAuthor : Jean-Philippe Aumasson, Willi Meier, Raphael C.-W. Phan
Title : The Hash Function Family LAKE
In : FSE -
Address :
Date : 2008
2 Cryptanalysis
2.1 Best Known Results
Collision Attack for LAKE-256 reduced to 4 (out of 8) rounds with complexity of 2109.
2.2 Generic Attacks
2.3 Collision Attacks
Florian Mendel, Martin Schl\"affer - Collisions for Round-Reduced LAKE
- ACISP 5107:267-281,2008
- http://www.springerlink.com/content/882420671673224r/
BibtexAuthor : Florian Mendel, Martin Schl\"affer
Title : Collisions for Round-Reduced LAKE
In : ACISP -
Address :
Date : 2008
