World Library  
My Account |  Register |  Help  
  
Flag as Inappropriate
Email this Article

NIST hash function competition

Article Id: WHEBN0020051952
Reproduction Date:

Title: NIST hash function competition  
Author: World Heritage Encyclopedia
Language: English
Subject: Skein (hash function), SHA-3, Grøstl, CubeHash, Lane (hash function)
Collection: Cryptographic Hash Functions, Cryptography Contests, National Institute of Standards and Technology, Nist Hash Function Competition
Publisher: World Heritage Encyclopedia
Publication
Date:
 

NIST hash function competition

The NIST hash function competition was an open competition held by the US National Institute of Standards and Technology (NIST) to develop a new hash function called SHA-3 to complement the older SHA-1 and SHA-2. The competition was formally announced in the Federal Register on November 2, 2007.[1] "NIST is initiating an effort to develop one or more additional hash algorithms through a public competition, similar to the development process for the Advanced Encryption Standard (AES)."[2] The competition ended on October 2, 2012 when the NIST announced that Keccak would be the new SHA-3 hash algorithm.[3]

People expect the winning hash function to be published as NIST FIPS 202 the "SHA-3 Standard", to complement FIPS 180-4, the Secure Hash Standard.

The NIST competition has inspired other competitions such as the Password Hashing Competition.

Contents

  • Process 1
  • Entrants 2
    • Winner 2.1
    • Finalists 2.2
    • Did not pass to Final Round 2.3
    • Did not pass to Round Two 2.4
      • Entrants with substantial weaknesses 2.4.1
      • Conceded entrants 2.4.2
    • Rejected entrants 2.5
  • References 3
  • External links 4

Process

Submissions were due October 31, 2008 and the list of candidates accepted for the first round was published on December 9, 2008.[4] NIST held a conference in late February 2009 where submitters presented their algorithms and NIST officials discussed criteria for narrowing down the field of candidates for Round 2.[5] The list of 14 candidates accepted to Round 2 was published on July 24, 2009.[6] Another conference was held on August 23–24, 2010 (after CRYPTO 2010) at the University of California, Santa Barbara, where the second-round candidates were discussed.[7] The announcement of the final round candidates occurred on December 10, 2010.[8] On October 2, 2012, the NIST announced its winner, choosing Keccak, created by Guido Bertoni, Joan Daemen and Gilles Van Assche of STMicroelectronics and Michaël Peeters of NXP.[3]

Entrants

This is an incomplete list of known submissions. NIST selected 51 entries for round 1.[4] 14 of them advanced to round 2,[6] from which 5 finalists were selected.

Winner

The winner was announced to be Keccak on October 2, 2012.[9]

Finalists

NIST selected five SHA-3 candidate algorithms to advance to the third (and final) round:[10]

NIST noted some factors that figured into its selection as it announced the finalists:[11]

  • Performance: "A couple of algorithms were wounded or eliminated by very large [hardware gate] area requirement – it seemed that the area they required precluded their use in too much of the potential application space."
  • Security: "We preferred to be conservative about security, and in some cases did not select algorithms with exceptional performance, largely because something about them made us 'nervous,' even though we knew of no clear attack against the full algorithm."
  • Analysis: "NIST eliminated several algorithms because of the extent of their second-round tweaks or because of a relative lack of reported cryptanalysis – either tended to create the suspicion that the design might not yet be fully tested and mature."
  • Diversity: The finalists included hashes based on different modes of operation, including the HAIFA and sponge function constructions, and with different internal structures, including ones based on AES, bitslicing, and alternating XOR with addition.

NIST has released a report explaining its evaluation algorithm-by-algorithm.[12][13]

Did not pass to Final Round

The following hash function submissions were accepted for Round Two, but did not make it to the final round. As noted in the announcement of the finalists, "none of these candidates was clearly broken".

Did not pass to Round Two

The following hash function submissions were accepted for Round One but did not pass to Round Two. They have neither been conceded by the submitters nor have had substantial cryptographic weaknesses. However, most of them have some weaknesses in the design components, or performance issues.

Entrants with substantial weaknesses

The following non-conceded Round One entrants have had substantial cryptographic weaknesses announced.

  • AURORA (Sony and Nagoya University)[27][28]
  • Blender[29][30][31]
  • Cheetah[32][33]
  • Dynamic SHA[34][35]
  • Dynamic SHA2[36][37]
  • ECOH
  • Edon-R[38][39]
  • EnRUPT[40][41]
  • ESSENCE[42][43]
  • LUX[44]
  • MCSSHA-3[45][46]
  • NaSHA
  • Sgàil[47][48]
  • Spectral Hash
  • Twister[49][50]
  • Vortex[51][52]

Conceded entrants

The following Round One entrants have been officially retracted from the competition by their submitters; they are considered broken according to the NIST official Round One Candidates web site. As such, they are withdrawn from the competition.

  • Abacus[4][53]
  • Boole[54][55]
  • DCH[4][56]
  • Khichidi-1[4][57]
  • MeshHash[4][58]
  • SHAMATA[4][59]
  • StreamHash[4][60]
  • Tangle[4][61]
  • WaMM[62][63]
  • Waterfall[64][65]

Rejected entrants

Several submissions received by NIST were not accepted as First Round Candidates, following an internal review by NIST.[4] In general, NIST gave no details as to why each was rejected. NIST also has not given a comprehensive list of rejected algorithms; there are known to be 13,[4][66] but only the following are public.

  • HASH 2X[67][68]
  • Maraca[69][70]
  • MIXIT[71]
  • NKS 2D[72][73][74]
  • Ponic[75][76]
  • ZK-Crypt[77]

References

  1. ^ "Federal Register / Vol. 72, No. 212" (PDF). Federal Register. Government Printing Office. November 2, 2007. Retrieved 2008-11-06. 
  2. ^ "cryptographic hash project - Background Information". Computer Security Resource Center. National Institute of Standards and Technology. November 2, 2007. Retrieved 2008-11-06. 
  3. ^ a b "NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition". NIST. October 2, 2012. Retrieved October 2, 2012. 
  4. ^ a b c d e f g h i j k "Round 1". 2008-12-09. Retrieved 2008-12-10. 
  5. ^ National Institute of Standards and Technology (December 9, 2008). "The First SHA-3 Candidate Conference". Retrieved 23 December 2008. 
  6. ^ a b "Second Round Candidates". National Institute for Standards and Technology. July 24, 2009. Retrieved July 24, 2009. 
  7. ^ National Institute of Standards and Technology (June 30, 2010). "The Second SHA-3 Candidate Conference". 
  8. ^ "Tentative Timeline of the Development of New Hash Functions". NIST. December 10, 2008. Retrieved September 15, 2009. 
  9. ^ NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition
  10. ^ THIRD (FINAL) ROUND CANDIDATES Retrieved 9 Nov 2011
  11. ^ SHA-3 Finalists Announced by NIST, blog post quoting NIST's announcement in full.
  12. ^ Status Report on the First Round of the SHA-3 Cryptographic Hash Algorithm Competition
  13. ^ Status Report on the Second Round of the SHA-3 Cryptographic Hash Algorithm Competition (PDF). Retrieved 2 March 2011
  14. ^ Svein Johan Knapskog; Danilo Gligoroski; Vlastimil Klima; Mohamed El-Hadedy; Jørn Amundsen; Stig Frode Mjølsnes (November 4, 2008). "blue_midnight_wish". Retrieved 10 November 2008. 
  15. ^ Søren S. Thomsen (2009). "Pseudo-cryptanalysis of Blue Midnight Wish" (PDF). Retrieved 19 May 2009. 
  16. ^ Henri Gilbert; Ryad Benadjila; Olivier Billet; Gilles Macario-Rat; Thomas Peyrin; Matt Robshaw; Yannick Seurin (October 29, 2008). "SHA-3 Proposal: ECHO" (PDF). Retrieved 11 December 2008. 
  17. ^ Özgül Kücük (31 October 2008). "The Hash Function Hamsi" (PDF). Retrieved 11 December 2008. 
  18. ^ Dai Watanabe; Christophe De Canniere; Hisayoshi Sato (31 October 2008). "Hash Function Luffa: Specification" (PDF). Retrieved 11 December 2008. 
  19. ^ Jean-François Misarsky; Emmanuel Bresson, Anne Canteaut, Benoît Chevallier-Mames, Christophe Clavier, Thomas Fuhr, Aline Gouget, Thomas Icart, Jean-François Misarsky, Marìa Naya-Plasencia, Pascal Paillier, Thomas Pornin, Jean-René Reinhard, Céline Thuillet, Marion Videau (October 28, 2008). "Shabal, a Submission to NIST’s Cryptographic Hash Algorithm Competition" (PDF). Retrieved 11 December 2008. 
  20. ^ Eli Biham; Orr Dunkelman. "The SHAvite-3 Hash Function" (PDF). Retrieved 11 December 2008. 
  21. ^ Jongin Lim; Donghoon Chang, Seokhie Hong, Changheon Kang, Jinkeon Kang, Jongsung Kim, Changhoon Lee, Jesang Lee, Jongtae Lee, Sangjin Lee, Yuseop Lee, Jaechul Sung (October 29, 2008). "ARIRANG" (PDF). Retrieved 11 December 2008. 
  22. ^ Philip Hawkes; Cameron McDonald (October 30, 2008). "Submission to the SHA-3 Competition: The CHI Family of Cryptographic Hash Algorithms". Retrieved 11 November 2008. 
  23. ^ Jacques Patarin; Louis Goubin; Mickael Ivascot; William Jalby; Olivier Ly; Valerie Nachef; Joana Treger; Emmanuel Volte. "CRUNCH". Retrieved 14 November 2008. 
  24. ^ Hirotaka Yoshida; Shoichi Hirose; Hidenori Kuwakado (30 October 2008). "SHA-3 Proposal: Lesamnta" (PDF). Retrieved 11 December 2008. 
  25. ^ Kerem Varıcı; Onur Özen and Çelebi Kocair. "The Sarmal Hash Function". Retrieved 12 October 2010. 
  26. ^ Daniel Penazzi; Miguel Montes. "The TIB3 Hash". Retrieved 2008-11-29. 
  27. ^ Tetsu Iwata, Kyoji Shibutani, Taizo Shirai, Shiho Moriai, Toru Akishita (October 31, 2008). "AURORA: A Cryptographic Hash Algorithm Family" (PDF). Retrieved 11 December 2008. 
  28. ^ Niels Ferguson, Stefan Lucks (2009). "Attacks on AURORA-512 and the Double-Mix Merkle-Damgaard Transform" (PDF). Retrieved 10 July 2009. 
  29. ^ Colin Bradbury (25 October 2008). "BLENDER: A Proposed New Family of Cryptographic Hash Algorithms" (PDF). Retrieved 11 December 2008. 
  30. ^ Craig Newbold. "Observations and Attacks On The SHA-3 Candidate Blender" (PDF). Retrieved 23 December 2008. 
  31. ^ Florian Mendel. "Preimage Attack on Blender" (PDF). Retrieved 23 December 2008. 
  32. ^ Dmitry Khovratovich; Alex Biryukov; Ivica Nikolić (October 30, 2008). "The Hash Function Cheetah: Specification and Supporting Documentation" (PDF). Retrieved 11 December 2008. 
  33. ^ Danilo Gligoroski (2008-12-12). "Danilo Gligoroski - Cheetah hash function is not resistant against length-extension attack". Retrieved 21 December 2008. 
  34. ^ Zijie Xu. "Dynamic SHA" (PDF). Retrieved 11 December 2008. 
  35. ^ Vlastimil Klima (2008-12-14). "Dynamic SHA is vulnerable to generic attacks". Retrieved 21 December 2008. 
  36. ^ Zijie Xu. "Dynamic SHA2" (PDF). NIST. Retrieved 11 December 2008. 
  37. ^ Vlastimil Klima (2008-12-14). "Dynamic SHA2 is vulnerable to generic attacks". Retrieved 21 December 2008. 
  38. ^ Danilo Gligoroski; Rune Steinsmo Ødegård; Marija Mihova; Svein Johan Knapskog; Ljupco Kocarev; Aleš Drápal (November 4, 2008). "edon-r". Retrieved 10 November 2008. 
  39. ^ Dmitry Khovratovich, Ivica Nikolić, Ralf-Philipp Weinmann (2008). "Cryptanalysis of Edon-R". Retrieved 10 July 2009. 
  40. ^ Sean O'Neil; Karsten Nohl; Luca Henzen (October 31, 2008). "EnRUPT - The Simpler The Better". Retrieved 10 November 2008. 
  41. ^ Sebastiaan Indesteege (November 6, 2008). "Collisions for EnRUPT". Retrieved 2008-11-07. 
  42. ^ Jason Worth Martin (October 21, 2008). "ESSENCE: A Candidate Hashing Algorithm for the NIST Competition" (PDF). Retrieved 2008-11-08. 
  43. ^ "Cryptanalysis of ESSENCE" (PDF). 
  44. ^ Ivica Nikolić; Alex Biryukov; Dmitry Khovratovich. "Hash family LUX - Algorithm Specifications and Supporting Documentation" (PDF). Retrieved 11 December 2008. 
  45. ^ Mikhail Maslennikov. "MCSSHA-3 hash algorithm". Retrieved 2008-11-08. 
  46. ^ Jean-Philippe Aumasson and María Naya-Plasencia. "Second preimages on MCSSHA-3" (PDF). Retrieved 14 November 2008. 
  47. ^ Peter Maxwell (September 2008). "The Sgàil Cryptographic Hash Function" (PDF). Retrieved 9 11 2008. 
  48. ^ Peter Maxwell (November 5, 2008). "Aww, p*sh!". Retrieved 2008-11-06. 
  49. ^ Michael Gorski; Ewan Fleischmann; Christian Forler (October 28, 2008). "The Twister Hash Function Family" (PDF). Retrieved 11 December 2008. 
  50. ^ Florian Mendel, Christian Rechberger, Martin Schläffer (2008). "Cryptanalysis of Twister" (PDF). Retrieved 19 May 2009. 
  51. ^ Michael Kounavis; Shay Gueron (November 3, 2008). "Vortex: A New Family of One Way Hash Functions based on Rijndael Rounds and Carry-less Multiplication". Retrieved 11 November 2008. 
  52. ^ Jean-Philippe Aumasson, Orr Dunkelman, Florian Mendel, Christian Rechberger, Søren S. Thomsen (2009). "Cryptanalysis of Vortex" (PDF). Retrieved 19 May 2009. 
  53. ^ Neil Sholer (October 29, 2008). "Abacus: A Candidate for SHA-3" (PDF). Retrieved 11 December 2008. 
  54. ^ Gregory G. Rose. "Design and Primitive Specification for Boole" (PDF). Retrieved 2008-11-08. 
  55. ^ Gregory G. Rose (10 Dec 2008). "OFFICIAL COMMENT: BOOLE" (PDF). Retrieved 23 December 2008. 
  56. ^ David A. Wilson (October 23, 2008). "The DCH Hash Function" (PDF). Retrieved 23 November 2008. 
  57. ^ Natarajan Vijayarangan. "A NEW HASH ALGORITHM: Khichidi-1" (PDF). Retrieved 11 December 2008. 
  58. ^ Björn Fay. "MeshHash" (PDF). Retrieved 30 November 2008. 
  59. ^ Orhun Kara; Adem Atalay, Ferhat Karakoc and Cevat Manap. "SHAMATA hash function: A candidate algorithm for NIST competition". Retrieved 10 November 2008. 
  60. ^ Michal Trojnara (October 14, 2008). "StreamHash Algorithm Specifications and Supporting Documentation" (PDF). Retrieved 15 December 2008. 
  61. ^ Rafael Alvarez; Gary McGuire and Antonio Zamora. "The Tangle Hash Function" (PDF). Retrieved 11 December 2008. 
  62. ^ John Washburn. "WAMM: A CANDIDATE ALGORITHM FOR THE SHA-3 COMPETITION" (PDF). Retrieved 9 11 2008. 
  63. ^ "OFFICIAL COMMENT: WaMM is Withdrawn" (PDFauthor=John Washburn). 20 Dec 2008. Retrieved 23 December 2008. 
  64. ^ Bob Hattersly (October 15, 2008). "Waterfall Hash - Algorithm Specification and Analysis" (PDF). Retrieved 9 11 2008. 
  65. ^ Bob Hattersley (20 Dec 2008). "OFFICIAL COMMENT: Waterfall is broken" (PDF). Retrieved 23 December 2008. 
  66. ^ Bruce Schneier (November 19, 2008). "Skein and SHA-3 News". Retrieved 23 December 2008. 
  67. ^ Jason Lee (November 6, 2008). "HASH 2X". TI BASIC Developer. Retrieved 2008-11-06. 
  68. ^ "HASH 2X". TI BASIC Developer. November 6, 2008. Retrieved 2008-11-06. 
  69. ^ Robert J. Jenkins Jr. "Algorithm Specification". Retrieved 15 December 2008. 
  70. ^ Anne Canteaut and María Naya-Plasencia. "Internal collision attack on Maraca" (PDF). Retrieved 15 December 2008. 
  71. ^ Michael P. Frank. "Algorithm Specification for MIXIT: a SHA-3 Candidate Cryptographic Hash Algorithm". Retrieved 12 January 2014. 
  72. ^ Geoffrey Park. "NKS 2D Cellular Automata Hash" (PDF). Retrieved 9 11 2008. 
  73. ^ Cristophe De Cannière (November 13, 2008). "Collisions for NKS2D-224". Retrieved 14 November 2008. 
  74. ^ Brandon Enright (November 14, 2008). "Collisions for NKS2D-512". Retrieved 14 November 2008. 
  75. ^ Peter Schmidt-Nielsen. "Ponic" (PDF). Retrieved 9 11 2008. 
  76. ^ María Naya-Plasencia. "Second preimage attack on Ponic" (PDF). Retrieved 30 November 2008. 
  77. ^ Nicolas T. Courtois, Carmi Gressel, Avi Hecht, Gregory V. Bard, Ran Granot. "ZK-Crypt Homepage". Retrieved 1 March 2009. 

External links

  • NIST website for competition
  • Official list of second round candidates
  • Official list of first round candidates
  • SHA-3 Zoo
  • Classification of the SHA-3 Candidates
  • Hash Function Lounge
  • VHDL source code developed by the Cryptographic Engineering Research Group (CERG) at George Mason University
 
Common functions
SHA-3 finalists
Other functions
MAC algorithms
Authenticated
encryption modes
Attacks
Design
Standardization
Utilization
 
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 



Copyright © World Library Foundation. All rights reserved. eBooks from World eBook Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.