Publication: Research - peer-review › Article in proceedings – Annual report year: 2009
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision and near-collision attacks on the compression function. The first attack uses differences in the chaining values and the block counter and finds collisions with complexity 233. The second attack utilizes differences in the chaining values and salt and yields collisions with complexity 242. The final attack uses differences only in the chaining values to yield near-collisions with complexity 299. All our attacks are independent of the number of rounds in the compression function. We illustrate the first two attacks by showing examples of collisions and near-collisions.
|Title of host publication||Fast Software Encryption|
|Number of pages||415|
|Place of Publication||Berlin / Heidelberg|
|State||Published - 2009|
|Event||Fast Software Encryption 2009 - Leuven, Belgium|
|Conference||Fast Software Encryption 2009|
|Period||22/02/2009 → 25/02/2009|
|Name||Lecture Notes in Computer Science|
|Citations||Error in DOI please contact firstname.lastname@example.org|
- cryptanalysis, collision attacks, LAKE hash family
Loading map data...