LAKE - Revision history

Fmendel: /* Best Known Results */

2008-11-03T14:47:54Z

‎Best Known Results

2008-11-03T13:43:12Z

‎Best Known Results

2008-11-03T13:42:02Z

‎Specification

2008-11-03T13:41:30Z

‎Specification

2008-11-03T13:41:12Z

‎Specification

2008-11-03T12:18:07Z

‎Collision Attacks

2008-11-03T12:17:57Z

‎Collision Attacks

2008-11-03T12:17:49Z

‎Collision Attacks

2008-11-03T12:16:34Z

‎Collision Attacks

2008-11-03T12:10:52Z

@@ Line 28: / Line 28: @@
 === Best Known Results ===
-Collision Attack for LAKE-256 on 4 Rounds (of 8) with complexity 2^109.
+Collision Attack for LAKE-256 reduced to 4 (out of 8) rounds with complexity of 2<sup>109</sup>.
 ----

← Older revision		Revision as of 13:43, 3 November 2008
Line 27:		Line 27:

	=== Best Known Results ===		=== Best Known Results ===
		+
		+	Collision Attack for LAKE-256 on 4 Rounds (of 8) with complexity 2^109.

	----		----

@@ Line 5: / Line 5: @@
 * compression function: 512-bit message block, 512,1024-bit chaining variable
 * Specification:
 <bibtex>
 @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.},
+}
-<\bibtex>
+</bibtex>
 == Cryptanalysis ==

@@ Line 20: / Line 20: @@
    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 ==

@@ Line 4: / Line 4: @@
 * max. message length: < 2<sup>64</sup> bits
 * compression function: 512-bit message block, 512,1024-bit chaining variable
 * Specification:
 == Cryptanalysis ==

@@ Line 21: / Line 21: @@
 <bibtex>
 @inproceedings{acispMendelS08,
-   author    = {Florian Mendel and Martin Schl"affer},
+   author    = {Florian Mendel and Martin Schl{\"a}ffer},
    title     = {Collisions for Round-Reduced LAKE},
    booktitle = {ACISP},

@@ Line 19: / Line 19: @@
 === Collision Attacks ===
+<bibtex>
 ----