Difference between revisions of "LAKE"
From The ECRYPT Hash Function Website
Mschlaeffer (talk | contribs) (→Specification) |
Mschlaeffer (talk | contribs) (→Best Known Results) |
||
| Line 27: | Line 27: | ||
=== Best Known Results === | === Best Known Results === | ||
| + | |||
| + | Collision Attack for LAKE-256 on 4 Rounds (of 8) with complexity 2^109. | ||
---- | ---- | ||
Revision as of 15:43, 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 on 4 Rounds (of 8) with complexity 2^109.
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
