Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
NIST hash function competition
open-in-new
<h2 id="process">Process</h2> <p>Submissions were due October 31, 2008 and the list of candidates accepted for the first round was published on December 9, 2008.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> 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.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> The list of 14 candidates accepted to Round 2 was published on July 24, 2009.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> Another conference was held on August 23–24, 2010 (after <a href="/facts/International_Cryptology_Conference/TgVIMDmb">CRYPTO</a> 2010) at the <a href="/facts/University_of_California,_Santa_Barbara/G7UvBWlK">University of California, Santa Barbara</a>, where the second-round candidates were discussed.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> The announcement of the final round candidates occurred on December 10, 2010.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> On October 2, 2012, NIST announced its winner, choosing <a href="/facts/Keccak/bA3BCp7K">Keccak</a>, created by Guido Bertoni, Joan Daemen, and Gilles Van Assche of STMicroelectronics and Michaël Peeters of NXP.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> </p> <h2 id="entrants">Entrants</h2> <p>This is an incomplete list of known submissions. NIST selected 51 entries for round 1.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> 14 of them advanced to round 2,<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> from which 5 finalists were selected. </p> <h3>Winner</h3> <p>The winner was announced to be <a href="/facts/Keccak/bA3BCp7K">Keccak</a> on October 2, 2012.<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> </p> <h3>Finalists</h3> <p>NIST selected five SHA-3 candidate algorithms to advance to the third (and final) round:<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> </p> <ul><li><a href="/facts/BLAKE_(hash_function)/3QuBJ24f">BLAKE</a> (Aumasson et al.)</li> <li><a href="/facts/Gr%C3%B8stl/xHEppsLl">Grøstl</a> (<a href="/facts/Lars_Knudsen/ludw9nqB">Knudsen</a> et al.)</li> <li><a href="/facts/JH_(hash_function)/1o6geqmH">JH</a> (Hongjun Wu)</li> <li><a href="/facts/Keccak/bA3BCp7K">Keccak</a> (Keccak team, <a href="/facts/Joan_Daemen/cqdIFHHG">Daemen</a> et al.)</li> <li><a href="/facts/Skein_(hash_function)/VAFDhncw">Skein</a> (<a href="/facts/Bruce_Schneier/kWxPFPmQ">Schneier</a> et al.)</li></ul> <p>NIST noted some factors that figured into its selection as it announced the finalists:<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> </p> <ul><li>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."</li> <li>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."</li> <li>Analysis: "NIST eliminated several algorithms because of the extent of their second-round tweaks or because of a relative lack of reported <a href="/facts/Cryptanalysis/7CPEQlJI">cryptanalysis</a> – either tended to create the suspicion that the design might not yet be fully tested and mature."</li> <li>Diversity: The finalists included hashes based on different modes of operation, including the HAIFA and <a href="/facts/Sponge_function/DA3BT6Ss">sponge function</a> constructions, and with different internal structures, including ones based on AES, bitslicing, and alternating XOR with addition.</li></ul> <p>NIST has released a report explaining its evaluation algorithm-by-algorithm.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a><a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a><a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a> </p> <h3>Did not pass to final round</h3> <p>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". </p> <ul><li>Blue Midnight Wish<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a><a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a></li> <li><a href="/facts/CubeHash/Wz6vD7e9">CubeHash</a> (<a href="/facts/Daniel_J._Bernstein/KQLuMRTx">Bernstein</a>)</li> <li>ECHO (<a href="/facts/France_Telecom/V5MqNPmG">France Telecom</a>)<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a></li> <li><a href="/facts/Fugue_(hash_function)/1sGH0n0E">Fugue</a> (<a href="/facts/IBM/QszA7nwd">IBM</a>)</li> <li>Hamsi<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a></li> <li>Luffa<a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a></li> <li>Shabal<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a></li> <li>SHAvite-3<a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a></li> <li><a href="/facts/SIMD_(hash_function)/oPusMEDM">SIMD</a></li></ul> <h3>Did not pass to round two</h3> <p>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. </p> <ul><li>ARIRANG<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a> (CIST – Korea University)</li> <li>CHI<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a></li> <li>CRUNCH<a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a></li> <li><a href="/facts/Fast_Syndrome_Based_Hash/G1q6gvmU">FSB</a></li> <li><a href="/facts/Lane_(hash_function)/nTQDgLQ4">Lane</a></li> <li>Lesamnta<a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a></li> <li><a href="/facts/MD6/m2R6ysYL">MD6</a> (<a href="/facts/Ron_Rivest/nQsIcAKa">Rivest</a> et al.)</li> <li><a href="/facts/SANDstorm/wTHmh2KW">SANDstorm</a> (<a href="/facts/Sandia_National_Laboratories/LYsKDj45">Sandia National Laboratories</a>)</li> <li>Sarmal<a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a></li> <li><a href="/facts/SWIFFT/ccycAN9n">SWIFFT</a>X</li> <li>TIB3<a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a></li></ul> <h4>Entrants with substantial weaknesses</h4> <p>The following non-conceded round one entrants have had substantial cryptographic weaknesses announced: </p> <ul><li>AURORA (<a href="/facts/Sony/7x4tCtBd">Sony</a> and <a href="/facts/Nagoya_University/0MABJXSj">Nagoya University</a>)<a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a><a class="footnote-ref" id="fnref:32" href="#fn:32"><sup>32</sup></a></li> <li>Blender<a class="footnote-ref" id="fnref:33" href="#fn:33"><sup>33</sup></a><a class="footnote-ref" id="fnref:34" href="#fn:34"><sup>34</sup></a><a class="footnote-ref" id="fnref:35" href="#fn:35"><sup>35</sup></a></li> <li>Cheetah<a class="footnote-ref" id="fnref:36" href="#fn:36"><sup>36</sup></a><a class="footnote-ref" id="fnref:37" href="#fn:37"><sup>37</sup></a></li> <li>Dynamic SHA<a class="footnote-ref" id="fnref:38" href="#fn:38"><sup>38</sup></a><a class="footnote-ref" id="fnref:39" href="#fn:39"><sup>39</sup></a></li> <li>Dynamic SHA2<a class="footnote-ref" id="fnref:40" href="#fn:40"><sup>40</sup></a><a class="footnote-ref" id="fnref:41" href="#fn:41"><sup>41</sup></a></li> <li><a href="/facts/Elliptic_curve_only_hash/AUIthHe3">ECOH</a></li> <li>Edon-R<a class="footnote-ref" id="fnref:42" href="#fn:42"><sup>42</sup></a><a class="footnote-ref" id="fnref:43" href="#fn:43"><sup>43</sup></a></li> <li><a href="/facts/EnRUPT/q6YRD5t0">EnRUPT</a><a class="footnote-ref" id="fnref:44" href="#fn:44"><sup>44</sup></a><a class="footnote-ref" id="fnref:45" href="#fn:45"><sup>45</sup></a></li> <li>ESSENCE<a class="footnote-ref" id="fnref:46" href="#fn:46"><sup>46</sup></a><a class="footnote-ref" id="fnref:47" href="#fn:47"><sup>47</sup></a></li> <li>LUX<a class="footnote-ref" id="fnref:48" href="#fn:48"><sup>48</sup></a></li> <li>MCSSHA-3<a class="footnote-ref" id="fnref:49" href="#fn:49"><sup>49</sup></a><a class="footnote-ref" id="fnref:50" href="#fn:50"><sup>50</sup></a></li> <li><a href="/facts/NaSHA_(hash_function)/7qxYAfas">NaSHA</a></li> <li>Sgàil<a class="footnote-ref" id="fnref:51" href="#fn:51"><sup>51</sup></a><a class="footnote-ref" id="fnref:52" href="#fn:52"><sup>52</sup></a></li> <li><a href="/facts/Spectral_Hash/lvxlqMBd">Spectral Hash</a></li> <li>Twister<a class="footnote-ref" id="fnref:53" href="#fn:53"><sup>53</sup></a><a class="footnote-ref" id="fnref:54" href="#fn:54"><sup>54</sup></a></li> <li>Vortex<a class="footnote-ref" id="fnref:55" href="#fn:55"><sup>55</sup></a><a class="footnote-ref" id="fnref:56" href="#fn:56"><sup>56</sup></a></li></ul> <h4>Conceded entrants</h4> <p>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.<a class="footnote-ref" id="fnref:57" href="#fn:57"><sup>57</sup></a> As such, they are withdrawn from the competition. </p> <ul><li>Abacus<a class="footnote-ref" id="fnref:58" href="#fn:58"><sup>58</sup></a><a class="footnote-ref" id="fnref:59" href="#fn:59"><sup>59</sup></a></li> <li>Boole<a class="footnote-ref" id="fnref:60" href="#fn:60"><sup>60</sup></a><a class="footnote-ref" id="fnref:61" href="#fn:61"><sup>61</sup></a></li> <li>DCH<a class="footnote-ref" id="fnref:62" href="#fn:62"><sup>62</sup></a><a class="footnote-ref" id="fnref:63" href="#fn:63"><sup>63</sup></a></li> <li>Khichidi-1<a class="footnote-ref" id="fnref:64" href="#fn:64"><sup>64</sup></a><a class="footnote-ref" id="fnref:65" href="#fn:65"><sup>65</sup></a></li> <li>MeshHash<a class="footnote-ref" id="fnref:66" href="#fn:66"><sup>66</sup></a><a class="footnote-ref" id="fnref:67" href="#fn:67"><sup>67</sup></a></li> <li>SHAMATA<a class="footnote-ref" id="fnref:68" href="#fn:68"><sup>68</sup></a><a class="footnote-ref" id="fnref:69" href="#fn:69"><sup>69</sup></a></li> <li>StreamHash<a class="footnote-ref" id="fnref:70" href="#fn:70"><sup>70</sup></a><a class="footnote-ref" id="fnref:71" href="#fn:71"><sup>71</sup></a></li> <li>Tangle<a class="footnote-ref" id="fnref:72" href="#fn:72"><sup>72</sup></a><a class="footnote-ref" id="fnref:73" href="#fn:73"><sup>73</sup></a></li> <li>WaMM<a class="footnote-ref" id="fnref:74" href="#fn:74"><sup>74</sup></a><a class="footnote-ref" id="fnref:75" href="#fn:75"><sup>75</sup></a></li> <li>Waterfall<a class="footnote-ref" id="fnref:76" href="#fn:76"><sup>76</sup></a><a class="footnote-ref" id="fnref:77" href="#fn:77"><sup>77</sup></a></li></ul> <h3>Rejected entrants</h3> <p>Several submissions received by NIST were not accepted as first-round candidates, following an internal review by NIST.<a class="footnote-ref" id="fnref:78" href="#fn:78"><sup>78</sup></a> 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,<a class="footnote-ref" id="fnref:79" href="#fn:79"><sup>79</sup></a><a class="footnote-ref" id="fnref:80" href="#fn:80"><sup>80</sup></a> but only the following are public. </p> <ul><li>HASH 2X</li> <li>Maraca<a class="footnote-ref" id="fnref:81" href="#fn:81"><sup>81</sup></a><a class="footnote-ref" id="fnref:82" href="#fn:82"><sup>82</sup></a></li> <li>MIXIT<a class="footnote-ref" id="fnref:83" href="#fn:83"><sup>83</sup></a></li> <li>NKS 2D<a class="footnote-ref" id="fnref:84" href="#fn:84"><sup>84</sup></a><a class="footnote-ref" id="fnref:85" href="#fn:85"><sup>85</sup></a><a class="footnote-ref" id="fnref:86" href="#fn:86"><sup>86</sup></a></li> <li>Ponic<a class="footnote-ref" id="fnref:87" href="#fn:87"><sup>87</sup></a><a class="footnote-ref" id="fnref:88" href="#fn:88"><sup>88</sup></a></li> <li>ZK-Crypt<a class="footnote-ref" id="fnref:89" href="#fn:89"><sup>89</sup></a></li></ul> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Advanced_Encryption_Standard_process/UkHpAuEj">Advanced Encryption Standard process</a></li> <li><a href="/facts/CAESAR_Competition/L7oFqMqo">CAESAR Competition</a> – Competition to design authenticated encryption schemes</li> <li><a href="/facts/Post-Quantum_Cryptography_Standardization/2xELnqQz">Post-Quantum Cryptography Standardization</a></li></ul> <h2 id="external-links">External links</h2> <ul><li><a href="http://csrc.nist.gov/groups/ST/hash/sha-3/index.html">NIST website for competition</a></li> <li><a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/submissions_rnd2.html">Official list of second round candidates</a></li> <li><a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/submissions_rnd1.html">Official list of first round candidates</a></li> <li><a href="http://ehash.iaik.tugraz.at/wiki/The_SHA-3_Zoo">SHA-3 Zoo</a></li> <li><a href="http://eprint.iacr.org/2008/511.pdf">Classification of the SHA-3 Candidates</a></li> <li><a href="https://web.archive.org/web/20081225051427/http://www.larc.usp.br/~pbarreto/hflounge.html">Hash Function Lounge</a></li> <li><a href="http://cryptography.gmu.edu/athena/index.php?id=source_codes">VHDL source code developed by the Cryptographic Engineering Research Group (CERG) at George Mason University</a></li> <li><a href="http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf">FIPS 202 – The SHA-3 Standard</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>"Federal Register / Vol. 72, No. 212" (PDF). Federal Register. Government Printing Office. November 2, 2007. Retrieved November 6, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/documents/FR_Notice_Nov07.pdf" target="_blank">http://csrc.nist.gov/groups/ST/hash/documents/FR_Notice_Nov07.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>"cryptographic hash project – Background Information". Computer Security Resource Center. National Institute of Standards and Technology. November 2, 2007. Retrieved November 6, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/index.html</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>"NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition". NIST. October 2, 2012. Retrieved October 2, 2012. <a href="https://www.nist.gov/itl/csd/sha-100212.cfm" target="_blank">https://www.nist.gov/itl/csd/sha-100212.cfm</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>National Institute of Standards and Technology (December 9, 2008). "The First SHA-3 Candidate Conference". Retrieved December 23, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/Feb2009/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/Feb2009/index.html</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>"Second Round Candidates". National Institute for Standards and Technology. July 24, 2009. Retrieved July 24, 2009. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/submissions_rnd2.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/submissions_rnd2.html</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>National Institute of Standards and Technology (June 30, 2010). "The Second SHA-3 Candidate Conference". <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/Aug2010/" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/Aug2010/</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>"Tentative Timeline of the Development of New Hash Functions". NIST. December 10, 2008. Retrieved September 15, 2009. <a href="http://csrc.nist.gov/groups/ST/hash/timeline.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/timeline.html</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition". NIST. October 2, 2012. Retrieved October 2, 2012. <a href="https://www.nist.gov/itl/csd/sha-100212.cfm" target="_blank">https://www.nist.gov/itl/csd/sha-100212.cfm</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>"Second Round Candidates". National Institute for Standards and Technology. July 24, 2009. Retrieved July 24, 2009. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/submissions_rnd2.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/submissions_rnd2.html</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition <a href="https://www.nist.gov/itl/csd/sha-100212.cfm" target="_blank">https://www.nist.gov/itl/csd/sha-100212.cfm</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>Third (Final) Round Candidates Retrieved 9 Nov 2011 <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round3/submissions_rnd3.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round3/submissions_rnd3.html</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>SHA-3 Finalists Announced by NIST Archived July 9, 2011, at the Wayback Machine, blog post quoting NIST's announcement in full. <a href="http://crypto.junod.info/2010/12/10/sha-3-finalists-announced-by-nist/" target="_blank">http://crypto.junod.info/2010/12/10/sha-3-finalists-announced-by-nist/</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>Status Report on the first round of the SHA-3 Cryptographic Hash Algorithm Competition (PDF). <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/sha3_NISTIR7620.pdf" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/sha3_NISTIR7620.pdf</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>Status Report on the second round of the SHA-3 Cryptographic Hash Algorithm Competition (PDF). Retrieved 2 March 2011 <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/Round2_Report_NISTIR_7764.pdf" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/documents/Round2_Report_NISTIR_7764.pdf</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>Third-Round Report of the SHA-3 Cryptographic Hash Algorithm Competition (PDF). <a href="http://nvlpubs.nist.gov/nistpubs/ir/2012/NIST.IR.7896.pdf" target="_blank">http://nvlpubs.nist.gov/nistpubs/ir/2012/NIST.IR.7896.pdf</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>Svein Johan Knapskog; Danilo Gligoroski; Vlastimil Klima; Mohamed El-Hadedy; Jørn Amundsen; Stig Frode Mjølsnes (November 4, 2008). "blue_midnight_wish". Retrieved November 10, 2008. <a href="http://www.item.ntnu.no/people/personalpages/fac/danilog/blue_midnight_wish" target="_blank">http://www.item.ntnu.no/people/personalpages/fac/danilog/blue_midnight_wish</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>Søren S. Thomsen (2009). "Pseudo-cryptanalysis of Blue Midnight Wish" (PDF). Archived from the original (PDF) on September 2, 2009. Retrieved May 19, 2009. <a href="https://web.archive.org/web/20090902193808/http://www2.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf" target="_blank">https://web.archive.org/web/20090902193808/http://www2.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>Henri Gilbert; Ryad Benadjila; Olivier Billet; Gilles Macario-Rat; Thomas Peyrin; Matt Robshaw; Yannick Seurin (October 29, 2008). "SHA-3 Proposal: ECHO" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/9/91/Echo.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/9/91/Echo.pdf</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>Özgül Kücük (October 31, 2008). "The Hash Function Hamsi" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/9/95/Hamsi.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/9/95/Hamsi.pdf</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>Dai Watanabe; Christophe De Canniere; Hisayoshi Sato (October 31, 2008). "Hash Function Luffa: Specification" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/e/ea/Luffa_Specification.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/e/ea/Luffa_Specification.pdf</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>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 December 11, 2008. <a href="/wiki/Anne_Canteaut" target="_blank">/wiki/Anne_Canteaut</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Eli Biham; Orr Dunkelman. "The SHAvite-3 Hash Function" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/f/f5/Shavite.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/f/f5/Shavite.pdf</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>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 December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/2/2c/Arirang.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/2/2c/Arirang.pdf</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>Philip Hawkes; Cameron McDonald (October 30, 2008). "Submission to the SHA-3 Competition: The CHI Family of Cryptographic Hash Algorithms" (PDF). Retrieved November 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/2/2c/Chi_submission.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/2/2c/Chi_submission.pdf</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>Jacques Patarin; Louis Goubin; Mickael Ivascot; William Jalby; Olivier Ly; Valerie Nachef; Joana Treger; Emmanuel Volte. "CRUNCH". Archived from the original on January 29, 2009. Retrieved November 14, 2008. <a href="https://web.archive.org/web/20090129125541/http://voltee.com/crunch/" target="_blank">https://web.archive.org/web/20090129125541/http://voltee.com/crunch/</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>Hirotaka Yoshida; Shoichi Hirose; Hidenori Kuwakado (October 30, 2008). "SHA-3 Proposal: Lesamnta" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/5/5c/Lesamnta.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/5/5c/Lesamnta.pdf</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>Kerem Varıcı; Onur Özen; Çelebi Kocair. "The Sarmal Hash Function". Archived from the original on June 11, 2011. Retrieved October 12, 2010. <a href="https://web.archive.org/web/20110611091218/http://homes.esat.kuleuven.be/~kvarici/sarmal_hash.html" target="_blank">https://web.archive.org/web/20110611091218/http://homes.esat.kuleuven.be/~kvarici/sarmal_hash.html</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>Daniel Penazzi; Miguel Montes. "The TIB3 Hash" (PDF). Retrieved November 29, 2008.[permanent dead link] <a href="http://www.famaf.unc.edu.ar/~penazzi/tib3/submitted/Supporting_Documentation/TIB3_Algorithm_Specification.pdf" target="_blank">http://www.famaf.unc.edu.ar/~penazzi/tib3/submitted/Supporting_Documentation/TIB3_Algorithm_Specification.pdf</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>Tetsu Iwata; Kyoji Shibutani; Taizo Shirai; Shiho Moriai; Toru Akishita (October 31, 2008). "AURORA: A Cryptographic Hash Algorithm Family" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/b/ba/AURORA.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/b/ba/AURORA.pdf</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> <li id="fn:32"><p>Niels Ferguson; Stefan Lucks (2009). "Attacks on AURORA-512 and the Double-MIX Merkle–Damgård Transform" (PDF). Retrieved July 10, 2009. <a href="/wiki/Niels_Ferguson" target="_blank">/wiki/Niels_Ferguson</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></p></li> <li id="fn:33"><p>Colin Bradbury (October 25, 2008). "BLENDER: A Proposed New Family of Cryptographic Hash Algorithms" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/5/5e/Blender.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/5/5e/Blender.pdf</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></p></li> <li id="fn:34"><p>Craig Newbold. "Observations and Attacks On The SHA-3 Candidate Blender" (PDF). Retrieved December 23, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/2/20/Observations_on_Blender.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/2/20/Observations_on_Blender.pdf</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></p></li> <li id="fn:35"><p>Florian Mendel. "Preimage Attack on Blender" (PDF). Retrieved December 23, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/4/48/Blender-preimage.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/4/48/Blender-preimage.pdf</a> <a href="#fnref:35" class="footnote-back-ref">↩</a></p></li> <li id="fn:36"><p>Dmitry Khovratovich; Alex Biryukov; Ivica Nikolić (October 30, 2008). "The Hash Function Cheetah: Specification and Supporting Documentation" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/c/ca/Cheetah.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/c/ca/Cheetah.pdf</a> <a href="#fnref:36" class="footnote-back-ref">↩</a></p></li> <li id="fn:37"><p>Danilo Gligoroski (December 12, 2008). "Danilo Gligoroski – Cheetah hash function is not resistant against length-extension attack". Retrieved December 21, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/d/d9/Cheetah_length-extension.txt" target="_blank">http://ehash.iaik.tugraz.at/uploads/d/d9/Cheetah_length-extension.txt</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></p></li> <li id="fn:38"><p>Zijie Xu. "Dynamic SHA" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/e/e2/DyamicSHA.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/e/e2/DyamicSHA.pdf</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></p></li> <li id="fn:39"><p>Vlastimil Klima (December 14, 2008). "Dynamic SHA is vulnerable to generic attacks". Retrieved December 21, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/e/e7/Dynamic-sha_length-extension.txt" target="_blank">http://ehash.iaik.tugraz.at/uploads/e/e7/Dynamic-sha_length-extension.txt</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></p></li> <li id="fn:40"><p>Zijie Xu. "Dynamic SHA2" (PDF). NIST. Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/5/5b/DyamicSHA2.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/5/5b/DyamicSHA2.pdf</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></p></li> <li id="fn:41"><p>Vlastimil Klima (December 14, 2008). "Dynamic SHA2 is vulnerable to generic attacks". Retrieved December 21, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/0/0e/Dynamic-sha2_length-extension.txt" target="_blank">http://ehash.iaik.tugraz.at/uploads/0/0e/Dynamic-sha2_length-extension.txt</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></p></li> <li id="fn:42"><p>Danilo Gligoroski; Rune Steinsmo Ødegård; Marija Mihova; Svein Johan Knapskog; Ljupco Kocarev; Aleš Drápal (November 4, 2008). "edon-r". Retrieved November 10, 2008. <a href="http://www.item.ntnu.no/people/personalpages/fac/danilog/edon-r" target="_blank">http://www.item.ntnu.no/people/personalpages/fac/danilog/edon-r</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></p></li> <li id="fn:43"><p>Dmitry Khovratovich; Ivica Nikolić; Ralf-Philipp Weinmann (2008). "Cryptanalysis of Edon-R" (PDF). Retrieved July 10, 2009. <a href="http://ehash.iaik.tugraz.at/uploads/7/74/Edon.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/7/74/Edon.pdf</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></p></li> <li id="fn:44"><p>Sean O'Neil; Karsten Nohl; Luca Henzen (October 31, 2008). "EnRUPT – The Simpler The Better". Retrieved November 10, 2008. <a href="http://www.enrupt.com/" target="_blank">http://www.enrupt.com/</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></p></li> <li id="fn:45"><p>Sebastiaan Indesteege (November 6, 2008). "Collisions for EnRUPT". Archived from the original on February 18, 2009. Retrieved November 7, 2008. <a href="https://web.archive.org/web/20090218093632/http://homes.esat.kuleuven.be/~sindeste/enrupt.html" target="_blank">https://web.archive.org/web/20090218093632/http://homes.esat.kuleuven.be/~sindeste/enrupt.html</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></p></li> <li id="fn:46"><p>Jason Worth Martin (October 21, 2008). "ESSENCE: A Candidate Hashing Algorithm for the NIST Competition" (PDF). Archived from the original (PDF) on June 12, 2010. Retrieved November 8, 2008. <a href="https://web.archive.org/web/20100612084041/http://www.math.jmu.edu/~martin/essence/Supporting_Documentation/essence_NIST.pdf" target="_blank">https://web.archive.org/web/20100612084041/http://www.math.jmu.edu/~martin/essence/Supporting_Documentation/essence_NIST.pdf</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></p></li> <li id="fn:47"><p>"Cryptanalysis of ESSENCE" (PDF). <a href="http://www.131002.net/data/papers/NRALLMP09.pdf" target="_blank">http://www.131002.net/data/papers/NRALLMP09.pdf</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></p></li> <li id="fn:48"><p>Ivica Nikolić; Alex Biryukov; Dmitry Khovratovich. "Hash family LUX – Algorithm Specifications and Supporting Documentation" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/f/f3/LUX.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/f/f3/LUX.pdf</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></p></li> <li id="fn:49"><p>Mikhail Maslennikov. "MCSSHA-3 hash algorithm". Archived from the original on May 2, 2009. Retrieved November 8, 2008. <a href="https://web.archive.org/web/20090502224350/http://registercsp.nets.co.kr/hash_competition.htm" target="_blank">https://web.archive.org/web/20090502224350/http://registercsp.nets.co.kr/hash_competition.htm</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></p></li> <li id="fn:50"><p>Jean-Philippe Aumasson; María Naya-Plasencia. "Second preimages on MCSSHA-3" (PDF). Retrieved November 14, 2008.[permanent dead link] <a href="http://131002.net/data/papers/AN.pdf" target="_blank">http://131002.net/data/papers/AN.pdf</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></p></li> <li id="fn:51"><p>Peter Maxwell (September 2008). "The Sgàil Cryptographic Hash Function" (PDF). Archived from the original (PDF) on November 12, 2013. Retrieved November 9, 2008. <a href="https://web.archive.org/web/20131112211946/http://www.allicient.co.uk/files/sgail/Supporting_Documentation/specification.pdf" target="_blank">https://web.archive.org/web/20131112211946/http://www.allicient.co.uk/files/sgail/Supporting_Documentation/specification.pdf</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></p></li> <li id="fn:52"><p>Peter Maxwell (November 5, 2008). "Aww, p*sh!". Archived from the original on November 9, 2008. Retrieved November 6, 2008. <a href="https://web.archive.org/web/20081109065226/http://www.allicient.co.uk/2008/11/05/aww-psh/" target="_blank">https://web.archive.org/web/20081109065226/http://www.allicient.co.uk/2008/11/05/aww-psh/</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></p></li> <li id="fn:53"><p>Michael Gorski; Ewan Fleischmann; Christian Forler (October 28, 2008). "The Twister Hash Function Family" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/3/39/Twister.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/3/39/Twister.pdf</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></p></li> <li id="fn:54"><p>Florian Mendel; Christian Rechberger; Martin Schläffer (2008). "Cryptanalysis of Twister" (PDF). Retrieved May 19, 2009. <a href="http://ehash.iaik.tugraz.at/uploads/d/dd/Twister_attack.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/d/dd/Twister_attack.pdf</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></p></li> <li id="fn:55"><p>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 November 11, 2008. <a href="http://eprint.iacr.org/2008/464" target="_blank">http://eprint.iacr.org/2008/464</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></p></li> <li id="fn:56"><p>Jean-Philippe Aumasson; Orr Dunkelman; Florian Mendel; Christian Rechberger; Søren S. Thomsen (2009). "Cryptanalysis of Vortex" (PDF). Retrieved May 19, 2009. <a href="http://www.131002.net/data/papers/ADMRT09.pdf" target="_blank">http://www.131002.net/data/papers/ADMRT09.pdf</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></p></li> <li id="fn:57"><p>Computer Security Division, Information Technology Laboratory (January 4, 2017). "SHA-3 Project – Hash Functions". CSRC: NIST. Retrieved April 26, 2019. <a href="https://csrc.nist.gov/projects/hash-functions/sha-3-project" target="_blank">https://csrc.nist.gov/projects/hash-functions/sha-3-project</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></p></li> <li id="fn:58"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></p></li> <li id="fn:59"><p>Neil Sholer (October 29, 2008). "Abacus: A Candidate for SHA-3" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/b/be/Abacus.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/b/be/Abacus.pdf</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></p></li> <li id="fn:60"><p>Gregory G. Rose. "Design and Primitive Specification for Boole" (PDF). Retrieved November 8, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/3/37/BoolePaper.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/3/37/BoolePaper.pdf</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></p></li> <li id="fn:61"><p>Gregory G. Rose (December 10, 2008). "Official Comment: Boole" (PDF). Retrieved December 23, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/BOOLE_Comments.pdf" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/BOOLE_Comments.pdf</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></p></li> <li id="fn:62"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:62" class="footnote-back-ref">↩</a></p></li> <li id="fn:63"><p>David A. Wilson (October 23, 2008). "The DCH Hash Function" (PDF). Retrieved November 23, 2008. <a href="http://web.mit.edu/dwilson/www/hash/dch/Supporting_Documentation/dch.pdf" target="_blank">http://web.mit.edu/dwilson/www/hash/dch/Supporting_Documentation/dch.pdf</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></p></li> <li id="fn:64"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:64" class="footnote-back-ref">↩</a></p></li> <li id="fn:65"><p>Natarajan Vijayarangan. "A New Hash Algorithm: Khichidi-1" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/d/d4/Khichidi-1.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/d/d4/Khichidi-1.pdf</a> <a href="#fnref:65" class="footnote-back-ref">↩</a></p></li> <li id="fn:66"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:66" class="footnote-back-ref">↩</a></p></li> <li id="fn:67"><p>Björn Fay. "MeshHash" (PDF). Retrieved November 30, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/5/5a/Specification_DIN-A4.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/5/5a/Specification_DIN-A4.pdf</a> <a href="#fnref:67" class="footnote-back-ref">↩</a></p></li> <li id="fn:68"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:68" class="footnote-back-ref">↩</a></p></li> <li id="fn:69"><p>Orhun Kara; Adem Atalay; Ferhat Karakoc; Cevat Manap. "SHAMATA hash function: A candidate algorithm for NIST competition". Archived from the original on February 1, 2009. Retrieved November 10, 2008. <a href="https://web.archive.org/web/20090201153442/http://www.uekae.tubitak.gov.tr/home.do?ot=1&sid=601&pid=547" target="_blank">https://web.archive.org/web/20090201153442/http://www.uekae.tubitak.gov.tr/home.do?ot=1&sid=601&pid=547</a> <a href="#fnref:69" class="footnote-back-ref">↩</a></p></li> <li id="fn:70"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:70" class="footnote-back-ref">↩</a></p></li> <li id="fn:71"><p>Michal Trojnara (October 14, 2008). "StreamHash Algorithm Specifications and Supporting Documentation" (PDF). Retrieved December 15, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/0/09/Streamhash.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/0/09/Streamhash.pdf</a> <a href="#fnref:71" class="footnote-back-ref">↩</a></p></li> <li id="fn:72"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:72" class="footnote-back-ref">↩</a></p></li> <li id="fn:73"><p>Rafael Alvarez; Gary McGuire; Antonio Zamora. "The Tangle Hash Function" (PDF). Retrieved December 11, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/4/40/Tangle.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/4/40/Tangle.pdf</a> <a href="#fnref:73" class="footnote-back-ref">↩</a></p></li> <li id="fn:74"><p>John Washburn. "WaMM: A Candidate Algorithm for the SHA-3 Competition" (PDF). Archived from the original (PDF) on April 19, 2009. Retrieved November 9, 2008. <a href="https://web.archive.org/web/20090419085817/http://www.washburnresearch.org/cryptography/archive/WaMM-SHA3.pdf" target="_blank">https://web.archive.org/web/20090419085817/http://www.washburnresearch.org/cryptography/archive/WaMM-SHA3.pdf</a> <a href="#fnref:74" class="footnote-back-ref">↩</a></p></li> <li id="fn:75"><p>"Official Comment: WaMM is Withdrawn" (PDFauthor=John Washburn). December 20, 2008. Retrieved December 23, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/WaMM_Comments.pdf" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/WaMM_Comments.pdf</a> <a href="#fnref:75" class="footnote-back-ref">↩</a></p></li> <li id="fn:76"><p>Bob Hattersly (October 15, 2008). "Waterfall Hash – Algorithm Specification and Analysis" (PDF). Retrieved November 9, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/1/19/Waterfall_Specification_1.0.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/1/19/Waterfall_Specification_1.0.pdf</a> <a href="#fnref:76" class="footnote-back-ref">↩</a></p></li> <li id="fn:77"><p>Bob Hattersley (December 20, 2008). "Official Comment: Waterfall is broken" (PDF). Retrieved December 23, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/Waterfall_Comments.pdf" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/Waterfall_Comments.pdf</a> <a href="#fnref:77" class="footnote-back-ref">↩</a></p></li> <li id="fn:78"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:78" class="footnote-back-ref">↩</a></p></li> <li id="fn:79"><p>"Round 1". December 9, 2008. Retrieved December 10, 2008. <a href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html" target="_blank">http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html</a> <a href="#fnref:79" class="footnote-back-ref">↩</a></p></li> <li id="fn:80"><p>Bruce Schneier (November 19, 2008). "Skein and SHA-3 News". Retrieved December 23, 2008. <a href="http://www.schneier.com/blog/archives/2008/11/skein_and_sha-3.html" target="_blank">http://www.schneier.com/blog/archives/2008/11/skein_and_sha-3.html</a> <a href="#fnref:80" class="footnote-back-ref">↩</a></p></li> <li id="fn:81"><p>Robert J. Jenkins Jr. "Algorithm Specification". Retrieved December 15, 2008. <a href="http://burtleburtle.net/bob/crypto/maraca/nist/" target="_blank">http://burtleburtle.net/bob/crypto/maraca/nist/</a> <a href="#fnref:81" class="footnote-back-ref">↩</a></p></li> <li id="fn:82"><p>Anne Canteaut & María Naya-Plasencia. "Internal collision attack on Maraca" (PDF). Retrieved December 15, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/5/52/Maraca.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/5/52/Maraca.pdf</a> <a href="#fnref:82" class="footnote-back-ref">↩</a></p></li> <li id="fn:83"><p>Michael P. Frank. "Algorithm Specification for MIXIT: a SHA-3 Candidate Cryptographic Hash Algorithm" (PDF). Archived from the original (PDF) on March 4, 2016. Retrieved January 12, 2014. <a href="https://web.archive.org/web/20160304051325/https://dl.dropboxusercontent.com/u/3133557/Bitcoin/mixit-spec.pdf" target="_blank">https://web.archive.org/web/20160304051325/https://dl.dropboxusercontent.com/u/3133557/Bitcoin/mixit-spec.pdf</a> <a href="#fnref:83" class="footnote-back-ref">↩</a></p></li> <li id="fn:84"><p>Geoffrey Park. "NKS 2D Cellular Automata Hash" (PDF). Retrieved November 9, 2008. <a href="http://geoffrey.park.googlepages.com/SHA3Submission01.pdf" target="_blank">http://geoffrey.park.googlepages.com/SHA3Submission01.pdf</a> <a href="#fnref:84" class="footnote-back-ref">↩</a></p></li> <li id="fn:85"><p>Cristophe De Cannière (November 13, 2008). "Collisions for NKS2D-224". Retrieved November 14, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/3/3f/NK2SD-224.txt" target="_blank">http://ehash.iaik.tugraz.at/uploads/3/3f/NK2SD-224.txt</a> <a href="#fnref:85" class="footnote-back-ref">↩</a></p></li> <li id="fn:86"><p>Brandon Enright (November 14, 2008). "Collisions for NKS2D-512". Retrieved November 14, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/9/93/NK2SD-512.txt" target="_blank">http://ehash.iaik.tugraz.at/uploads/9/93/NK2SD-512.txt</a> <a href="#fnref:86" class="footnote-back-ref">↩</a></p></li> <li id="fn:87"><p>Peter Schmidt-Nielsen. "Ponic" (PDF). Retrieved November 9, 2008. <a href="http://ehash.iaik.tugraz.at/uploads/3/3c/PonicSpecification.pdf" target="_blank">http://ehash.iaik.tugraz.at/uploads/3/3c/PonicSpecification.pdf</a> <a href="#fnref:87" class="footnote-back-ref">↩</a></p></li> <li id="fn:88"><p>María Naya-Plasencia. "Second preimage attack on Ponic" (PDF). Retrieved November 30, 2008. <a href="http://131002.net/data/papers/ponic.pdf" target="_blank">http://131002.net/data/papers/ponic.pdf</a> <a href="#fnref:88" class="footnote-back-ref">↩</a></p></li> <li id="fn:89"><p>Nicolas T. Courtois; Carmi Gressel; Avi Hecht; Gregory V. Bard; Ran Granot. "ZK-Crypt Homepage". Archived from the original on February 9, 2009. Retrieved March 1, 2009. <a href="https://web.archive.org/web/20090209040334/http://fortressgb.com/apage/39649.php" target="_blank">https://web.archive.org/web/20090209040334/http://fortressgb.com/apage/39649.php</a> <a href="#fnref:89" class="footnote-back-ref">↩</a></p></li> </ol>