ESSENCE - Revision history

Fmendel: fixed bibtex entry

2009-09-11T07:45:19Z

fixed bibtex entry

Fmendel: fixed bibtex entry

2009-09-11T07:41:04Z

fixed bibtex entry

JAumasson: Abstract corrected

2009-09-10T15:50:29Z

Abstract corrected

JAumasson: Updated results and BibTeX

2009-09-10T15:47:42Z

Updated results and BibTeX

JAumasson: fixed URL http://www.131002.net/data/papers/NRALMP09.pdf

2009-09-09T15:36:12Z

fixed URL http://www.131002.net/data/papers/NRALMP09.pdf

JAumasson: Added author to essenceNRALMP09

2009-06-29T13:02:01Z

Added author to essenceNRALMP09

JAumasson: "512" changed to "384/512"

2009-06-23T11:14:27Z

"512" changed to "384/512"

JAumasson: Updated attack complexities

2009-06-23T07:55:17Z

Updated attack complexities

JAumasson: Complexity corrected

2009-06-17T12:15:51Z

Complexity corrected

SThomsen at 14:10, 16 June 2009

2009-06-16T14:10:15Z

@@ Line 68: / Line 68: @@
   url    = {http://www.mat.dtu.dk/people/S.Thomsen/essence/Essence-obs.pdf},
   howpublished = {Available online},
-  year   = {2009}
+  year   = {2009},
+}
 </bibtex>
@@ Line 78: / Line 79: @@
   url    = {http://www.nickymouha.be/papers/Essence-MouhaSekar.pdf},
   howpublished = {Available online},
-  year   = {2009}
+  year   = {2009},
+}
 </bibtex>
@@ Line 88: / Line 90: @@
      howpublished = {Cryptology ePrint Archive, Report 2009/302},
      year = {2009},
-     url = {http://eprint.iacr.org/2009/302.pdf}
+     url = {http://eprint.iacr.org/2009/302.pdf},
      note = {\url{http://eprint.iacr.org/}},
      abstract = {ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design, and that has thus far remained unbroken. Preliminary analysis in its documentation argues that it resists standard differential cryptanalysis. This paper disproves this claim, showing that advanced techniques can be used to significantly reduce the cost of such attacks: using a manually found differential path and a nontrivial search algorithm, we obtain shortcut collision attacks on the full ESSENCE-256 and ESSENCE-512, with respective complexities $2^{67.4}$ and $2^{134.7}$. As an aside, we show how to use these attacks for forging valid message/MAC pairs for HMAC-ESSENCE-256 and HMAC-ESSENCE-512, essentially at the same cost as a collision.},
+}

@@ Line 88: / Line 88: @@
      howpublished = {Cryptology ePrint Archive, Report 2009/302},
      year = {2009},
      note = {\url{http://eprint.iacr.org/}},
      abstract = {ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design, and that has thus far remained unbroken. Preliminary analysis in its documentation argues that it resists standard differential cryptanalysis. This paper disproves this claim, showing that advanced techniques can be used to significantly reduce the cost of such attacks: using a manually found differential path and a nontrivial search algorithm, we obtain shortcut collision attacks on the full ESSENCE-256 and ESSENCE-512, with respective complexities $2^{67.4}$ and $2^{134.7}$. As an aside, we show how to use these attacks for forging valid message/MAC pairs for HMAC-ESSENCE-256 and HMAC-ESSENCE-512, essentially at the same cost as a collision.},
+}

@@ Line 89: / Line 89: @@
      year = {2009},
      note = {\url{http://eprint.iacr.org/}},
-     abstract = {ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design, and that has thus far remained unbroken. Preliminary analysis in its documentation argues that it resists standard differential cryptanalysis. This paper disproves this claim, showing that advanced techniques can be used to significantly reduce the cost of such attacks: using a manually found differential characteristic and a nontrivial search algorithm, we obtain shortcut collision attacks on the full ESSENCE-256 and ESSENCE-512, with respective complexities $2^{91}$ and $2^{168}$. As an aside, we show how to use these attacks for forging valid message/MAC pairs for HMAC-ESSENCE-256 and HMAC-ESSENCE-512, essentially at the same cost as a collision. },
+     abstract = {ESSENCE is a hash function submitted to the NIST Hash Competition that stands out as a hardware-friendly and highly parallelizable design, and that has thus far remained unbroken. Preliminary analysis in its documentation argues that it resists standard differential cryptanalysis. This paper disproves this claim, showing that advanced techniques can be used to significantly reduce the cost of such attacks: using a manually found differential path and a nontrivial search algorithm, we obtain shortcut collision attacks on the full ESSENCE-256 and ESSENCE-512, with respective complexities $2^{67.4}$ and $2^{134.7}$. As an aside, we show how to use these attacks for forging valid message/MAC pairs for HMAC-ESSENCE-256 and HMAC-ESSENCE-512, essentially at the same cost as a collision.},
+}

@@ Line 53: / Line 53: @@
 | pseudo-collision || hash || 512 || 31 rounds || 2<sup>254.6</sup> || - || [http://www.nickymouha.be/papers/Essence-MouhaSekar.pdf Mouha et al.]
 |-
-| style="background:orange" | collision || hash || 224/256 ||  || 2<sup>91</sup> || - || [http://www.131002.net/data/papers/NRALLMP09.pdf Naya-Plasencia et al.]
+| style="background:orange" | collision || hash || 224/256 ||  || 2<sup>67.4</sup> || - || [http://www.131002.net/data/papers/NRALLMP09.pdf Naya-Plasencia et al.]
 |-
-| style="background:orange" | collision || hash || 384/512 ||  || 2<sup>168</sup> || - || [http://www.131002.net/data/papers/NRALLMP09.pdf Naya-Plasencia et al.]
+| style="background:orange" | collision || hash || 384/512 ||  || 2<sup>134.7</sup> || - || [http://www.131002.net/data/papers/NRALLMP09.pdf Naya-Plasencia et al.]
 |-
 |}
@@ Line 84: / Line 84: @@
 <bibtex>
 @misc{essenceNRALLMP09,
- author = {María Naya-Plasencia and Andrea Röck and Jean-Philippe Aumasson and Yann Laigle-Chapuy and Gaëtan Leurent and Willi Meier and Thomas Peyrin},
+    author = {María Naya-Plasencia and Andrea Röck and Jean-Philippe Aumasson and Yann Laigle-Chapuy and Gaëtan Leurent and Willi Meier and Thomas Peyrin},
- title  = {Cryptanalysis of ESSENCE},
+    title = {Cryptanalysis of ESSENCE},
- url    = {http://www.131002.net/data/papers/NRALLMP09.pdf},
+    howpublished = {Cryptology ePrint Archive, Report 2009/302},
- howpublished = {Available online},
+    year = {2009},
- year   = {2009}
+    note = {\url{http://eprint.iacr.org/}},
+}

@@ Line 53: / Line 53: @@
 | pseudo-collision || hash || 512 || 31 rounds || 2<sup>254.6</sup> || - || [http://www.nickymouha.be/papers/Essence-MouhaSekar.pdf Mouha et al.]
 |-
-| style="background:orange" | collision || hash || 224/256 ||  || 2<sup>91</sup> || - || [http://www.131002.net/data/papers/NRALMP09.pdf Naya-Plasencia et al.]
+| style="background:orange" | collision || hash || 224/256 ||  || 2<sup>91</sup> || - || [http://www.131002.net/data/papers/NRALLMP09.pdf Naya-Plasencia et al.]
 |-
-| style="background:orange" | collision || hash || 384/512 ||  || 2<sup>168</sup> || - || [http://www.131002.net/data/papers/NRALMP09.pdf Naya-Plasencia et al.]
+| style="background:orange" | collision || hash || 384/512 ||  || 2<sup>168</sup> || - || [http://www.131002.net/data/papers/NRALLMP09.pdf Naya-Plasencia et al.]
 |-
 |}

@@ Line 51: / Line 51: @@
 | key recovery || block cipher || 512 || 14 rounds || 2<sup>450</sup> || - || [http://www.nickymouha.be/papers/Essence-MouhaSekar.pdf Mouha et al.]
 |-
-| pseudo-collision || hash || 512 || 31 rounds || 2<sup>252.8</sup> || - || [http://www.nickymouha.be/papers/Essence-MouhaSekar.pdf Mouha et al.]
+| pseudo-collision || hash || 512 || 31 rounds || 2<sup>254.6</sup> || - || [http://www.nickymouha.be/papers/Essence-MouhaSekar.pdf Mouha et al.]
 |-
 | style="background:orange" | collision || hash || 224/256 ||  || 2<sup>109</sup> || - || [http://www.131002.net/data/papers/NRALMP09.pdf Naya-Plasencia et al.]

← Older revision		Revision as of 14:10, 16 June 2009
Line 1:		Line 1:
−	= The algorithm ==	+	== The algorithm ==

	* Authors: Jason Worth Martin		* Authors: Jason Worth Martin