NIST hash function competition

Submissions were due October 31, 2008 and the list of candidates accepted for the first round was published on December 9, 2008.{{cite web|url=http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html|title=Round 1|date=2008-12-09|access-date=2008-12-10}} 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.{{cite web|url=https://csrc.nist.gov/groups/ST/hash/sha-3/Round1/Feb2009/index.html|title=The First SHA-3 Candidate Conference|author=National Institute of Standards and Technology|date=December 9, 2008|access-date=23 December 2008}} The list of 14 candidates accepted to Round 2 was published on July 24, 2009.{{cite web|url=http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/submissions_rnd2.html|title=Second Round Candidates|publisher=National Institute for Standards and Technology|date=July 24, 2009|access-date=July 24, 2009}} 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.{{cite web|url=https://csrc.nist.gov/groups/ST/hash/sha-3/Round2/Aug2010/|title=The Second SHA-3 Candidate Conference|author=National Institute of Standards and Technology|date=June 30, 2010}} The announcement of the final round candidates occurred on December 10, 2010.{{cite web|url=http://csrc.nist.gov/groups/ST/hash/timeline.html|title=Tentative Timeline of the Development of New Hash Functions|publisher=NIST|date=December 10, 2008|access-date=September 15, 2009}} On October 2, 2012, NIST announced its winner, choosing Keccak, created by Guido Bertoni, Joan Daemen, and Gilles Van Assche of STMicroelectronics and Michaël Peeters of NXP.

This is an incomplete list of known submissions.

NIST selected 51 entries for round 1. 14 of them advanced to round 2, from which 5 finalists were selected.

The winner was announced to be Keccak on October 2, 2012.[https://www.nist.gov/itl/csd/sha-100212.cfm NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition]

NIST selected five SHA-3 candidate algorithms to advance to the third (and final) round:[http://csrc.nist.gov/groups/ST/hash/sha-3/Round3/submissions_rnd3.html Third (Final) Round Candidates] Retrieved 9 Nov 2011

• BLAKE (Aumasson et al.)
• Grøstl (Knudsen et al.)
• JH (Hongjun Wu)
• Keccak (Keccak team, Daemen et al.)
• Skein (Schneier et al.)

NIST noted some factors that figured into its selection as it announced the finalists:[http://crypto.junod.info/2010/12/10/sha-3-finalists-announced-by-nist/ SHA-3 Finalists Announced by NIST] {{Webarchive|url=https://web.archive.org/web/20110709093032/http://crypto.junod.info/2010/12/10/sha-3-finalists-announced-by-nist/ |date=July 9, 2011 }}, blog post quoting NIST's announcement in full.

• 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.[http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/sha3_NISTIR7620.pdf Status Report on the first round of the SHA-3 Cryptographic Hash Algorithm Competition] (PDF).[http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/Round2_Report_NISTIR_7764.pdf Status Report on the second round of the SHA-3 Cryptographic Hash Algorithm Competition] (PDF). Retrieved 2 March 2011[https://nvlpubs.nist.gov/nistpubs/ir/2012/NIST.IR.7896.pdf Third-Round Report of the SHA-3 Cryptographic Hash Algorithm Competition] (PDF).

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".

{{div col|colwidth=22em}}

• Blue Midnight Wish{{cite web|url=http://www.item.ntnu.no/people/personalpages/fac/danilog/blue_midnight_wish|title=blue_midnight_wish|access-date=10 November 2008|author=Svein Johan Knapskog|author2=Danilo Gligoroski |author3=Vlastimil Klima |author4=Mohamed El-Hadedy |author5=Jørn Amundsen |author6=Stig Frode Mjølsnes |date=November 4, 2008}}{{cite web|url=http://www.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf|title=Pseudo-cryptanalysis of Blue Midnight Wish|format=PDF|author=Søren S. Thomsen|year=2009|access-date=19 May 2009|url-status=dead|archive-url=https://web.archive.org/web/20090902193808/http://www2.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf|archive-date=2 September 2009}}
• CubeHash (Bernstein)
• ECHO (France Telecom){{cite web|url=https://ehash.iaik.tugraz.at/uploads/9/91/Echo.pdf|title=SHA-3 Proposal: ECHO|format=PDF|author=Henri Gilbert|author2=Ryad Benadjila |author3=Olivier Billet |author4=Gilles Macario-Rat |author5=Thomas Peyrin |author6=Matt Robshaw |author7=Yannick Seurin |date=October 29, 2008|access-date=11 December 2008}}
• Fugue (IBM)
• Hamsi{{cite web|url=https://ehash.iaik.tugraz.at/uploads/9/95/Hamsi.pdf|title=The Hash Function Hamsi|format=PDF|author=Özgül Kücük|date=31 October 2008|access-date=11 December 2008}}
• Luffa{{cite web|url=https://ehash.iaik.tugraz.at/uploads/e/ea/Luffa_Specification.pdf|title=Hash Function Luffa: Specification|format=PDF|author=Dai Watanabe|author2=Christophe De Canniere |author3=Hisayoshi Sato |date=31 October 2008|access-date=11 December 2008}}
• Shabal{{cite web|url=https://ehash.iaik.tugraz.at/uploads/6/6c/Shabal.pdf|title=Shabal, a Submission to NIST's Cryptographic Hash Algorithm Competition|format=PDF|author=Jean-François Misarsky |author2=Emmanuel Bresson |author3=Anne Canteaut|author3-link=Anne Canteaut |author4=Benoît Chevallier-Mames |author5=Christophe Clavier |author6=Thomas Fuhr |author7=Aline Gouget |author7-link= Aline Gouget |author8=Thomas Icart |author9=Jean-François Misarsky |author10=Marìa Naya-Plasencia |author11=Pascal Paillier |author12=Thomas Pornin |author13=Jean-René Reinhard |author14=Céline Thuillet |author15=Marion Videau |date=October 28, 2008|access-date=11 December 2008}}
• SHAvite-3{{cite web|url=https://ehash.iaik.tugraz.at/uploads/f/f5/Shavite.pdf|title=The SHAvite-3 Hash Function|format=PDF|author=Eli Biham|author2=Orr Dunkelman|access-date=11 December 2008}}
• SIMD

{{div col end}}

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.

{{div col|colwidth=22em}}

• ARIRANG{{cite web|url=https://ehash.iaik.tugraz.at/uploads/2/2c/Arirang.pdf|title=ARIRANG|format=PDF|author=Jongin Lim |author2=Donghoon Chang |author3=Seokhie Hong |author4=Changheon Kang |author5=Jinkeon Kang |author6=Jongsung Kim |author7=Changhoon Lee |author8=Jesang Lee |author9=Jongtae Lee |author10=Sangjin Lee |author11=Yuseop Lee |author12=Jaechul Sung |date=October 29, 2008|access-date=11 December 2008}} (CIST – Korea University)
• CHI{{cite web|url=https://ehash.iaik.tugraz.at/uploads/2/2c/Chi_submission.pdf|title=Submission to the SHA-3 Competition: The CHI Family of Cryptographic Hash Algorithms

|access-date=11 November 2008|author=Philip Hawkes|author2=Cameron McDonald|date=October 30, 2008}}

• CRUNCH{{cite web |url=http://www.voltee.com/crunch/ |title=CRUNCH |access-date=14 November 2008 |author=Jacques Patarin |author2=Louis Goubin |author3=Mickael Ivascot |author4=William Jalby |author5=Olivier Ly |author6=Valerie Nachef |author7=Joana Treger |author8=Emmanuel Volte |archive-url=https://web.archive.org/web/20090129125541/http://voltee.com/crunch/ |archive-date=January 29, 2009 |url-status=dead }}
• FSB
• Lane
• Lesamnta{{cite web|url=https://ehash.iaik.tugraz.at/uploads/5/5c/Lesamnta.pdf|title=SHA-3 Proposal: Lesamnta|format=PDF|author=Hirotaka Yoshida|author2=Shoichi Hirose |author3=Hidenori Kuwakado |date=30 October 2008|access-date=11 December 2008}}
• MD6 (Rivest et al.)
• SANDstorm (Sandia National Laboratories)
• Sarmal{{cite web|url=http://homes.esat.kuleuven.be/~kvarici/sarmal_hash.html|title=The Sarmal Hash Function|access-date=12 October 2010|author=Kerem Varıcı|author2=Onur Özen|author3=Çelebi Kocair|url-status=dead|archive-url=https://web.archive.org/web/20110611091218/http://homes.esat.kuleuven.be/~kvarici/sarmal_hash.html|archive-date=11 June 2011}}
• SWIFFTX
• TIB3{{cite web|url=http://www.famaf.unc.edu.ar/~penazzi/tib3/submitted/Supporting_Documentation/TIB3_Algorithm_Specification.pdf|title=The TIB3 Hash|author=Daniel Penazzi|author2=Miguel Montes|access-date=2008-11-29}}{{dead link|date=February 2018 |bot=InternetArchiveBot |fix-attempted=yes }}

{{div col end}}

The following non-conceded round one entrants have had substantial cryptographic weaknesses announced:

{{div col|colwidth=22em}}

• AURORA (Sony and Nagoya University){{cite web|url=https://ehash.iaik.tugraz.at/uploads/b/ba/AURORA.pdf|title=AURORA: A Cryptographic Hash Algorithm Family|format=PDF|author=Tetsu Iwata |author2=Kyoji Shibutani |author3=Taizo Shirai |author4=Shiho Moriai |author5=Toru Akishita |date=October 31, 2008|access-date=11 December 2008}}{{cite web|url=https://eprint.iacr.org/2009/113.pdf|title=Attacks on AURORA-512 and the Double-MIX Merkle–Damgård Transform|format=PDF |author=Niels Ferguson |author-link=Niels Ferguson |author2=Stefan Lucks |author2-link=Stefan Lucks |year=2009|access-date=10 July 2009}}
• Blender{{cite web|url=https://ehash.iaik.tugraz.at/uploads/5/5e/Blender.pdf|title=BLENDER: A Proposed New Family of Cryptographic Hash Algorithms|format=PDF|author=Colin Bradbury|date=25 October 2008|access-date=11 December 2008}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/2/20/Observations_on_Blender.pdf|title=Observations and Attacks On The SHA-3 Candidate Blender|format=PDF|author=Craig Newbold|access-date=23 December 2008}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/4/48/Blender-preimage.pdf|title=Preimage Attack on Blender|format=PDF|author=Florian Mendel|access-date=23 December 2008}}
• Cheetah{{cite web|url=https://ehash.iaik.tugraz.at/uploads/c/ca/Cheetah.pdf|title=The Hash Function Cheetah: Specification and Supporting Documentation|format=PDF|author=Dmitry Khovratovich|author2=Alex Biryukov |author3=Ivica Nikolić |date=October 30, 2008|access-date=11 December 2008}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/d/d9/Cheetah_length-extension.txt|title=Danilo Gligoroski – Cheetah hash function is not resistant against length-extension attack|author=Danilo Gligoroski|date=2008-12-12|access-date=21 December 2008}}
• Dynamic SHA{{cite web|url=https://ehash.iaik.tugraz.at/uploads/e/e2/DyamicSHA.pdf|title=Dynamic SHA|format=PDF|author=Zijie Xu|access-date=11 December 2008}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/e/e7/Dynamic-sha_length-extension.txt|title=Dynamic SHA is vulnerable to generic attacks

|author=Vlastimil Klima|date=2008-12-14|access-date=21 December 2008}}

• Dynamic SHA2{{cite web|url=https://ehash.iaik.tugraz.at/uploads/5/5b/DyamicSHA2.pdf|title=Dynamic SHA2|format=PDF|author=Zijie Xu|publisher=NIST|access-date=11 December 2008}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/0/0e/Dynamic-sha2_length-extension.txt|title=Dynamic SHA2 is vulnerable to generic attacks|author=Vlastimil Klima|date=2008-12-14|access-date=21 December 2008}}
• ECOH
• Edon-R{{cite web|url=http://www.item.ntnu.no/people/personalpages/fac/danilog/edon-r|title=edon-r|access-date=10 November 2008|author=Danilo Gligoroski|author2=Rune Steinsmo Ødegård |author3=Marija Mihova |author4=Svein Johan Knapskog |author5=Ljupco Kocarev |author6=Aleš Drápal |date=November 4, 2008}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/7/74/Edon.pdf|title=Cryptanalysis of Edon-R|access-date=10 July 2009 |author1=Dmitry Khovratovich |author2=Ivica Nikolić |author3=Ralf-Philipp Weinmann |year=2008}}
• EnRUPT{{cite web|url=https://www.enrupt.com/|title=EnRUPT – The Simpler The Better|access-date=10 November 2008|author=Sean O'Neil|author2=Karsten Nohl |author3=Luca Henzen |date=October 31, 2008}}{{cite web|url=http://homes.esat.kuleuven.be/~sindeste/enrupt.html|title=Collisions for EnRUPT|access-date=2008-11-07|author=Sebastiaan Indesteege|date=November 6, 2008|url-status=dead|archive-url=https://web.archive.org/web/20090218093632/http://homes.esat.kuleuven.be/~sindeste/enrupt.html|archive-date=February 18, 2009}}
• ESSENCE{{cite web|url=http://www.math.jmu.edu/~martin/essence/Supporting_Documentation/essence_NIST.pdf|archive-url=https://web.archive.org/web/20100612084041/http://www.math.jmu.edu/~martin/essence/Supporting_Documentation/essence_NIST.pdf|url-status=dead|archive-date=June 12, 2010|title=ESSENCE: A Candidate Hashing Algorithm for the NIST Competition|access-date=2008-11-08|author=Jason Worth Martin|date=October 21, 2008|format=PDF}}{{cite web|url=http://www.131002.net/data/papers/NRALLMP09.pdf|title=Cryptanalysis of ESSENCE|format=PDF}}
• LUX{{cite web|url=https://ehash.iaik.tugraz.at/uploads/f/f3/LUX.pdf|title=Hash family LUX – Algorithm Specifications and Supporting Documentation|format=PDF|author=Ivica Nikolić|author2=Alex Biryukov |author3=Dmitry Khovratovich |access-date=11 December 2008}}
• MCSSHA-3{{cite web|url=http://registercsp.nets.co.kr/hash_competition.htm|title=MCSSHA-3 hash algorithm|access-date=2008-11-08|author=Mikhail Maslennikov|url-status=dead|archive-url=https://web.archive.org/web/20090502224350/http://registercsp.nets.co.kr/hash_competition.htm|archive-date=2009-05-02}}{{cite web|url=http://131002.net/data/papers/AN.pdf|title=Second preimages on MCSSHA-3|format=PDF|access-date=14 November 2008|author=Jean-Philippe Aumasson|author2=María Naya-Plasencia}}{{dead link|date=February 2018 |bot=InternetArchiveBot |fix-attempted=yes }}
• NaSHA
• Sgàil{{cite web|url=http://www.allicient.co.uk/files/sgail/Supporting_Documentation/specification.pdf|title=The Sgàil Cryptographic Hash Function|access-date=2008-11-09|date=September 2008|author=Peter Maxwell|format=PDF|archive-url=https://web.archive.org/web/20131112211946/http://www.allicient.co.uk/files/sgail/Supporting_Documentation/specification.pdf|archive-date=November 12, 2013|url-status=dead}}{{cite web|url=http://www.allicient.co.uk/2008/11/05/aww-psh/|title=Aww, p*sh!|access-date=2008-11-06|author=Peter Maxwell|date=November 5, 2008|archive-url=https://web.archive.org/web/20081109065226/http://www.allicient.co.uk/2008/11/05/aww-psh/|archive-date=November 9, 2008|url-status=dead}}
• Spectral Hash
• Twister{{cite web|url=https://ehash.iaik.tugraz.at/uploads/3/39/Twister.pdf|title=The Twister Hash Function Family|format=PDF|author=Michael Gorski|author2=Ewan Fleischmann |author3=Christian Forler |date=October 28, 2008|access-date=11 December 2008}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/d/dd/Twister_attack.pdf|title=Cryptanalysis of Twister|format=PDF|author1=Florian Mendel |author2=Christian Rechberger |author3=Martin Schläffer |year=2008|access-date=19 May 2009}}
• Vortex{{cite web|url=https://eprint.iacr.org/2008/464|title=Vortex: A New Family of One Way Hash Functions based on Rijndael Rounds and Carry-less Multiplication|access-date=11 November 2008|author=Michael Kounavis|author2=Shay Gueron|date=November 3, 2008}}{{cite web|url=http://www.131002.net/data/papers/ADMRT09.pdf|title=Cryptanalysis of Vortex|format=PDF|author1=Jean-Philippe Aumasson |author2=Orr Dunkelman |author3=Florian Mendel |author4=Christian Rechberger |author5=Søren S. Thomsen |year=2009|access-date=19 May 2009}}

{{div col end}}

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.{{cite web|first1=Information Technology Laboratory|last1=Computer Security Division|access-date=2019-04-26|title=SHA-3 Project – Hash Functions|url=https://csrc.nist.gov/projects/hash-functions/sha-3-project|date=4 January 2017|website=CSRC: NIST}} As such, they are withdrawn from the competition.

{{div col|colwidth=22em}}

• Abacus{{cite web|url=https://ehash.iaik.tugraz.at/uploads/b/be/Abacus.pdf|title=Abacus: A Candidate for SHA-3|format=PDF|author=Neil Sholer

|date=October 29, 2008|access-date=11 December 2008}}

• Boole{{cite web|url=https://ehash.iaik.tugraz.at/uploads/3/37/BoolePaper.pdf|title=Design and Primitive Specification for Boole|access-date=2008-11-08|author=Gregory G. Rose|format=PDF}}{{cite web|url=http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/BOOLE_Comments.pdf|title=Official Comment: Boole|format=PDF|author=Gregory G. Rose|date=10 Dec 2008|access-date=23 December 2008}}
• DCH{{cite web|url=https://web.mit.edu/dwilson/www/hash/dch/Supporting_Documentation/dch.pdf|title=The DCH Hash Function|format=PDF|author=David A. Wilson|date=October 23, 2008|access-date=23 November 2008}}
• Khichidi-1{{cite web|url=https://ehash.iaik.tugraz.at/uploads/d/d4/Khichidi-1.pdf|title=A New Hash Algorithm: Khichidi-1|format=PDF|author=Natarajan Vijayarangan|access-date=11 December 2008}}
• MeshHash{{cite web|url=https://ehash.iaik.tugraz.at/uploads/5/5a/Specification_DIN-A4.pdf|title=MeshHash|format=PDF|author=Björn Fay|access-date=30 November 2008}}
• SHAMATA{{cite web|url=http://www.uekae.tubitak.gov.tr/home.do?ot=1&sid=601&pid=547|archive-url=https://web.archive.org/web/20090201153442/http://www.uekae.tubitak.gov.tr/home.do?ot=1&sid=601&pid=547|url-status=dead|archive-date=1 February 2009|title=SHAMATA hash function: A candidate algorithm for NIST competition|access-date=10 November 2008|author=Orhun Kara|author2=Adem Atalay|author3=Ferhat Karakoc|author4=Cevat Manap}}
• StreamHash{{cite web|url=https://ehash.iaik.tugraz.at/uploads/0/09/Streamhash.pdf|title=StreamHash Algorithm Specifications and Supporting Documentation|format=PDF|author=Michal Trojnara|date= October 14, 2008|access-date=15 December 2008}}
• Tangle{{cite web|url=https://ehash.iaik.tugraz.at/uploads/4/40/Tangle.pdf|title=The Tangle Hash Function|format=PDF|author=Rafael Alvarez |author2=Gary McGuire |author3=Antonio Zamora|access-date=11 December 2008}}
• WaMM{{cite web|url=http://www.washburnresearch.org/cryptography/archive/WaMM-SHA3.pdf|archive-url=https://web.archive.org/web/20090419085817/http://www.washburnresearch.org/cryptography/archive/WaMM-SHA3.pdf|url-status=dead|archive-date=2009-04-19|title=WaMM: A Candidate Algorithm for the SHA-3 Competition|access-date=2008-11-09|author=John Washburn|format=PDF}}{{cite web|url=http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/WaMM_Comments.pdf|title=Official Comment: WaMM is Withdrawn|format=PDFauthor=John Washburn|date=20 Dec 2008|access-date=23 December 2008}}
• Waterfall{{cite web|url=https://ehash.iaik.tugraz.at/uploads/1/19/Waterfall_Specification_1.0.pdf|title=Waterfall Hash – Algorithm Specification and Analysis|access-date=2008-11-09|date=October 15, 2008|author=Bob Hattersly|format=PDF}}{{cite web|url=http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/Waterfall_Comments.pdf|title=Official Comment: Waterfall is broken|format=PDF|author=Bob Hattersley|date=20 Dec 2008|access-date=23 December 2008}}

{{div col end}}

Several submissions received by NIST were not accepted as first-round candidates, following an internal review by NIST. 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,{{cite web|url=http://www.schneier.com/blog/archives/2008/11/skein_and_sha-3.html|title=Skein and SHA-3 News|author=Bruce Schneier|date=November 19, 2008|access-date=23 December 2008}} but only the following are public.

{{div col|colwidth=22em}}

• HASH 2X{{Citation needed|date=May 2018}}
• Maraca{{cite web|url=http://burtleburtle.net/bob/crypto/maraca/nist/|title=Algorithm Specification|author=Robert J. Jenkins Jr.|access-date=15 December 2008}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/5/52/Maraca.pdf|title=Internal collision attack on Maraca|format=PDF|author=Anne Canteaut|author2=María Naya-Plasencia|name-list-style=amp|access-date=15 December 2008}}
• MIXIT{{cite web|url=https://dl.dropboxusercontent.com/u/3133557/Bitcoin/mixit-spec.pdf|title=Algorithm Specification for MIXIT: a SHA-3 Candidate Cryptographic Hash Algorithm|author=Michael P. Frank|access-date=12 January 2014|archive-url=https://web.archive.org/web/20160304051325/https://dl.dropboxusercontent.com/u/3133557/Bitcoin/mixit-spec.pdf|archive-date=March 4, 2016|url-status=dead}}
• NKS 2D{{cite web|url=http://geoffrey.park.googlepages.com/SHA3Submission01.pdf|title=NKS 2D Cellular Automata Hash|access-date=2008-11-09|author=Geoffrey Park|format=PDF}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/3/3f/NK2SD-224.txt|title=Collisions for NKS2D-224|author=Cristophe De Cannière|access-date=14 November 2008|date=November 13, 2008}}{{cite web|url=https://ehash.iaik.tugraz.at/uploads/9/93/NK2SD-512.txt|title=Collisions for NKS2D-512|author=Brandon Enright|access-date=14 November 2008|date=November 14, 2008}}
• Ponic{{cite web|url=https://ehash.iaik.tugraz.at/uploads/3/3c/PonicSpecification.pdf|title=Ponic|access-date=2008-11-09|author=Peter Schmidt-Nielsen|format=PDF}}{{cite web|url=http://131002.net/data/papers/ponic.pdf|title=Second preimage attack on Ponic|format=PDF|author=María Naya-Plasencia|access-date=30 November 2008}}
• ZK-Crypt{{cite web|url=http://www.fortressgb.com/apage/39649.php|title=ZK-Crypt Homepage|author=Nicolas T. Courtois|author2=Carmi Gressel|author3=Avi Hecht|author4=Gregory V. Bard|author5=Ran Granot|access-date=1 March 2009|url-status=dead|archive-url=https://web.archive.org/web/20090209040334/http://fortressgb.com/apage/39649.php|archive-date=9 February 2009}}

{{div col end}}

• Advanced Encryption Standard process
• CAESAR Competition – Competition to design authenticated encryption schemes
• Post-Quantum Cryptography Standardization

{{Reflist|30em}}

• [http://csrc.nist.gov/groups/ST/hash/sha-3/index.html NIST website for competition]
• [http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/submissions_rnd2.html Official list of second round candidates]
• [http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/submissions_rnd1.html Official list of first round candidates]
• [http://ehash.iaik.tugraz.at/wiki/The_SHA-3_Zoo SHA-3 Zoo]
• [https://eprint.iacr.org/2008/511.pdf Classification of the SHA-3 Candidates]
• [https://web.archive.org/web/20081225051427/http://www.larc.usp.br/~pbarreto/hflounge.html Hash Function Lounge]
• [https://cryptography.gmu.edu/athena/index.php?id=source_codes VHDL source code developed by the Cryptographic Engineering Research Group (CERG) at George Mason University]
• [https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf FIPS 202 – The SHA-3 Standard]

{{Cryptography navbox|hash}}

Category:Cryptographic hash functions

Category:Cryptography contests

Category:National Institute of Standards and Technology