JH - Revision history

Mlauridsen: Fixed some minor syntax in the table.

2013-02-14T12:35:47Z

Fixed some minor syntax in the table.

Mlauridsen: Added results of Naya-Plasencia, Toz and Varici (2012) in rows 0 through 5 of "Building blocks"

2013-02-14T10:09:42Z

Added results of Naya-Plasencia, Toz and Varici (2012) in rows 0 through 5 of "Building blocks"

Mschlaeffer: references updated

2011-04-22T08:12:07Z

references updated

Tnad at 07:44, 22 April 2011

2011-04-22T07:44:36Z

Mschlaeffer at 08:34, 4 April 2011

2011-04-04T08:34:16Z

Mschlaeffer at 09:26, 21 March 2011

2011-03-21T09:26:47Z

Mschlaeffer at 08:49, 21 March 2011

2011-03-21T08:49:53Z

Mschlaeffer at 08:06, 21 March 2011

2011-03-21T08:06:03Z

Mschlaeffer: link to JH website corrected

2011-03-09T07:22:15Z

link to JH website corrected

JAumasson: /* Building blocks */

2010-12-08T08:41:27Z

‎Building blocks

@@ Line 65: / Line 65: @@
 |-
 |  semi-free-start collision || compression function || 256 || 26 rounds  || 2<sup>112</sup> || 2<sup>57.6</sup> || [http://dx.doi.org/10.1007/978-3-642-25385-0_14 Naya-Plasencia,Toz,Varici]
 |-
 |  semi-free-start collision || compression function || 256 || 32 rounds  || 2<sup>304</sup> || 2<sup>57.6</sup> || [http://dx.doi.org/10.1007/978-3-642-25385-0_14 Naya-Plasencia,Toz,Varici]
 |-
 |  semi-free-start collision || compression function || 256 || 36 rounds  || 2<sup>352</sup> || 2<sup>57.6</sup> || [http://dx.doi.org/10.1007/978-3-642-25385-0_14 Naya-Plasencia,Toz,Varici]
 |-
 |  semi-free-start collision || compression function || 256 || 37 rounds  || 2<sup>352</sup> || 2<sup>57.6</sup> || [http://dx.doi.org/10.1007/978-3-642-25385-0_14 Naya-Plasencia,Toz,Varici]
 |-
 |  distinguisher || internal permutation || 256 || 42 rounds  || 2<sup>304</sup> || 2<sup>57.6</sup> || [http://dx.doi.org/10.1007/978-3-642-25385-0_14 Naya-Plasencia,Toz,Varici]
 |-
 |  distinguisher || internal permutation || 256 || 42 rounds  || 2<sup>352</sup> || 2<sup>57.6</sup> || [http://dx.doi.org/10.1007/978-3-642-25385-0_14 Naya-Plasencia,Toz,Varici]
 |-
 |  semi-free-start collision || compression function || 256 || 16 rounds  || 2<sup>96.12</sup> || 2<sup>96.12</sup> || [http://eprint.iacr.org/2010/607.pdf Naya-Plasencia]
 |-

@@ Line 63: / Line 63: @@
 |- style="background:#efefef;"
 |   Type of Analysis || Hash Function Part || Hash Size (n) || Parameters/Variants || Compression Function Calls || Memory Requirements ||   Reference
 |-
 |  semi-free-start collision || compression function || 256 || 16 rounds  || 2<sup>96.12</sup> || 2<sup>96.12</sup> || [http://eprint.iacr.org/2010/607.pdf Naya-Plasencia]
@@ Line 82: / Line 100: @@
 |}
 <bibtex>

@@ Line 89: / Line 89: @@
      howpublished = {Cryptology ePrint Archive, Report 2010/607},
      year = {2010},
      url = {http://eprint.iacr.org/2010/607.pdf},
      abstract = {Rebound attacks are a state-of-the-art analysis method for hash functions. These cryptanalysis methods are based on a well chosen differential path and have been applied to several hash functions from the SHA-3 competition, providing the best known analysis in these cases. In this paper we study rebound attacks in detail and find for a great number of cases, that complexities of existing attacks can be improved. This is done by determining problems that adapt optimally to the cryptanalytic situation, and by using better algorithms to follow the differential path. These improvements are essentially based on merging big lists in a more efficient way, as well as on new ideas on how to reduce the complexities. As a result, we introduce general purpose new algorithms for enabling further rebound analysis to be as performant as possible. We illustrate our new algorithms for real hash functions and demonstrate how to reduce the complexities of the best known analysis on five hash functions: JH, Grøstl, ECHO, Luffa and Lane (the first four are round two SHA-3 candidates).},
@@ Line 111: / Line 110: @@
    title     = {Security Analysis of the Mode of JH Hash Function},
    url = {http://www.isical.ac.in/~rishi_r/FSE2010-146.pdf},
-   booktitle  = {FSE},
+   booktitle = {FSE},
-   year       = {2010},
+   year      = {2010},
-   series     = {LNCS},
+  pages     = {168-191},
-   note = {To appear}
+  publisher = {Springer},
+}
 </bibtex>
@@ Line 125: / Line 126: @@
    booktitle  = {FSE},
    year       = {2010},
-   series     = {LNCS},
+  pages     = {286-303},
-   note = {To appear}
+  publisher = {Springer},
+}
 </bibtex>
@@ Line 135: / Line 138: @@
    title     = {Pseudo-collision and pseudo-second preimage on JH},
    url = {http://ehash.iaik.tugraz.at/uploads/a/a8/Jh1.txt},
-   howpublished = {NIST mailing list (local link)},
+   howpublished = {NIST mailing list},
    year = {2008},
+}

@@ Line 89: / Line 89: @@
      howpublished = {Cryptology ePrint Archive, Report 2010/607},
      year = {2010},
-     note = {\url{http://eprint.iacr.org/}},
+     note = {\\url{http://eprint.iacr.org/}},
      url = {http://eprint.iacr.org/2010/607.pdf},
      abstract = {Rebound attacks are a state-of-the-art analysis method for hash functions. These cryptanalysis methods are based on a well chosen differential path and have been applied to several hash functions from the SHA-3 competition, providing the best known analysis in these cases. In this paper we study rebound attacks in detail and find for a great number of cases, that complexities of existing attacks can be improved. This is done by determining problems that adapt optimally to the cryptanalytic situation, and by using better algorithms to follow the differential path. These improvements are essentially based on merging big lists in a more efficient way, as well as on new ideas on how to reduce the complexities. As a result, we introduce general purpose new algorithms for enabling further rebound analysis to be as performant as possible. We illustrate our new algorithms for real hash functions and demonstrate how to reduce the complexities of the best known analysis on five hash functions: JH, Grøstl, ECHO, Luffa and Lane (the first four are round two SHA-3 candidates).},

@@ Line 4: / Line 4: @@
 * Website: [http://www3.ntu.edu.sg/home/wuhj/research/jh/ http://www3.ntu.edu.sg/home/wuhj/research/jh/]
 * NIST submission package:
-** round 3: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round3/documents/JH_FinalRnd.zip JH_FinalRnd.zip]
+** Round 3: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round3/documents/JH_FinalRnd.zip JH_FinalRnd.zip]
-** round 1/2: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/JH_Round2.zip JH_Round2.zip] (old versions: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/JH.zip JH.zip], [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/JHUpdate.zip JHUpdate.zip])
+** Round 1/2: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/JH_Round2.zip JH_Round2.zip] (old versions: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/JH.zip JH.zip], [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/JHUpdate.zip JHUpdate.zip])
@@ Line 27: / Line 27: @@
+}
 </bibtex>
 == Cryptanalysis ==

@@ Line 23: / Line 23: @@
    title     = {The Hash Function JH},
    url        = {http://ehash.iaik.tugraz.at/uploads/1/1d/Jh20090915.pdf},
-   howpublished = {Submission to NIST (updated for round 2)},
+   howpublished = {Submission to NIST (Round 1/2)},
    year      = {2009},
+}
 </bibtex>
 == Cryptanalysis ==

@@ Line 4: / Line 4: @@
 * Website: [http://www3.ntu.edu.sg/home/wuhj/research/jh/ http://www3.ntu.edu.sg/home/wuhj/research/jh/]
 * NIST submission package:
 ** round 1/2: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/JH_Round2.zip JH_Round2.zip] (old versions: [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/JH.zip JH.zip], [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/JHUpdate.zip JHUpdate.zip])
@@ Line 11: / Line 12: @@
    author    = {Hongjun Wu},
    title     = {The Hash Function JH},
-   url        = {http://icsd.i2r.a-star.edu.sg/staff/hongjun/jh/jh_round2.pdf},
+   url        = {http://www3.ntu.edu.sg/home/wuhj/research/jh/jh_round3.pdf},
    howpublished = {Submission to NIST (updated)},
    year      = {2009},
@@ Line 21: / Line 42: @@
    author    = {Hongjun Wu},
    title     = {The Hash Function JH},
-   url        = {http://icsd.i2r.a-star.edu.sg/staff/hongjun/jh/jh.pdf},
+   url        = {http://ehash.iaik.tugraz.at/uploads/8/8f/Jh.pdf},
    howpublished = {Submission to NIST},
    year      = {2008},
@@ Line 34: / Line 55: @@
 A description of the tables is given [http://ehash.iaik.tugraz.at/wiki/Cryptanalysis_Categories#Individual_Hash_Function_Tables here].
-Recommended security parameter: '''35.5''' rounds
+Recommended security parameter: '''42''' rounds
 === Hash function ===