CINXE.COM

<!DOCTYPE html> <html class="client-nojs vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available" lang="en" dir="ltr"> <head> <meta charset="UTF-8"> <title>NIST hash function competition - Wikipedia</title> <script>(function(){var className="client-js vector-feature-language-in-header-enabled vector-feature-language-in-main-page-header-disabled vector-feature-sticky-header-disabled vector-feature-page-tools-pinned-disabled vector-feature-toc-pinned-clientpref-1 vector-feature-main-menu-pinned-disabled vector-feature-limited-width-clientpref-1 vector-feature-limited-width-content-enabled vector-feature-custom-font-size-clientpref-1 vector-feature-appearance-pinned-clientpref-1 vector-feature-night-mode-enabled skin-theme-clientpref-day vector-toc-available";var cookie=document.cookie.match(/(?:^|; )enwikimwclientpreferences=([^;]+)/);if(cookie){cookie[1].split('%2C').forEach(function(pref){className=className.replace(new RegExp('(^| )'+pref.replace(/-clientpref-\w+$|[^\w-]+/g,'')+'-clientpref-\\w+( |$)'),'$1'+pref+'$2');});}document.documentElement.className=className;}());RLCONF={"wgBreakFrames":false,"wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"dmy", "wgMonthNames":["","January","February","March","April","May","June","July","August","September","October","November","December"],"wgRequestId":"9c355b7b-243a-4553-b2d8-c4ed11957fa8","wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"NIST_hash_function_competition","wgTitle":"NIST hash function competition","wgCurRevisionId":1210884072,"wgRevisionId":1210884072,"wgArticleId":20051952,"wgIsArticle":true,"wgIsRedirect":false,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":["Webarchive template wayback links","All articles with dead external links","Articles with dead external links from February 2018","Articles with permanently dead external links","Use American English from March 2019","All Wikipedia articles written in American English","Articles with short description","Short description matches Wikidata","Use mdy dates from March 2019","All articles with unsourced statements", "Articles with unsourced statements from May 2018","NIST hash function competition","Cryptographic hash functions","Cryptography contests","National Institute of Standards and Technology"],"wgPageViewLanguage":"en","wgPageContentLanguage":"en","wgPageContentModel":"wikitext","wgRelevantPageName":"NIST_hash_function_competition","wgRelevantArticleId":20051952,"wgIsProbablyEditable":true,"wgRelevantPageIsProbablyEditable":true,"wgRestrictionEdit":[],"wgRestrictionMove":[],"wgNoticeProject":"wikipedia","wgCiteReferencePreviewsActive":false,"wgFlaggedRevsParams":{"tags":{"status":{"levels":1}}},"wgMediaViewerOnClick":true,"wgMediaViewerEnabledByDefault":true,"wgPopupsFlags":0,"wgVisualEditor":{"pageLanguageCode":"en","pageLanguageDir":"ltr","pageVariantFallbacks":"en"},"wgMFDisplayWikibaseDescriptions":{"search":true,"watchlist":true,"tagline":false,"nearby":true},"wgWMESchemaEditAttemptStepOversample":false,"wgWMEPageLength":30000,"wgRelatedArticlesCompat":[],"wgCentralAuthMobileDomain": false,"wgEditSubmitButtonLabelPublish":true,"wgULSPosition":"interlanguage","wgULSisCompactLinksEnabled":false,"wgVector2022LanguageInHeader":true,"wgULSisLanguageSelectorEmpty":false,"wgWikibaseItemId":"Q15229223","wgCheckUserClientHintsHeadersJsApi":["brands","architecture","bitness","fullVersionList","mobile","model","platform","platformVersion"],"GEHomepageSuggestedEditsEnableTopics":true,"wgGETopicsMatchModeEnabled":false,"wgGEStructuredTaskRejectionReasonTextInputEnabled":false,"wgGELevelingUpEnabledForUser":false};RLSTATE={"ext.globalCssJs.user.styles":"ready","site.styles":"ready","user.styles":"ready","ext.globalCssJs.user":"ready","user":"ready","user.options":"loading","ext.cite.styles":"ready","skins.vector.search.codex.styles":"ready","skins.vector.styles":"ready","skins.vector.icons":"ready","jquery.makeCollapsible.styles":"ready","ext.wikimediamessages.styles":"ready","ext.visualEditor.desktopArticleTarget.noscript":"ready","ext.uls.interlanguage":"ready", "wikibase.client.init":"ready","ext.wikimediaBadges":"ready"};RLPAGEMODULES=["ext.cite.ux-enhancements","site","mediawiki.page.ready","jquery.makeCollapsible","mediawiki.toc","skins.vector.js","ext.centralNotice.geoIP","ext.centralNotice.startUp","ext.gadget.ReferenceTooltips","ext.gadget.switcher","ext.urlShortener.toolbar","ext.centralauth.centralautologin","mmv.bootstrap","ext.popups","ext.visualEditor.desktopArticleTarget.init","ext.visualEditor.targetLoader","ext.echo.centralauth","ext.eventLogging","ext.wikimediaEvents","ext.navigationTiming","ext.uls.interface","ext.cx.eventlogging.campaigns","ext.cx.uls.quick.actions","wikibase.client.vector-2022","ext.checkUser.clientHints","ext.quicksurveys.init","ext.growthExperiments.SuggestedEditSession","wikibase.sidebar.tracking"];</script> <script>(RLQ=window.RLQ||[]).push(function(){mw.loader.impl(function(){return["user.options@12s5i",function($,jQuery,require,module){mw.user.tokens.set({"patrolToken":"+\\","watchToken":"+\\","csrfToken":"+\\"}); }];});});</script> <link rel="stylesheet" href="/w/load.php?lang=en&modules=ext.cite.styles%7Cext.uls.interlanguage%7Cext.visualEditor.desktopArticleTarget.noscript%7Cext.wikimediaBadges%7Cext.wikimediamessages.styles%7Cjquery.makeCollapsible.styles%7Cskins.vector.icons%2Cstyles%7Cskins.vector.search.codex.styles%7Cwikibase.client.init&only=styles&skin=vector-2022"> <script async="" src="/w/load.php?lang=en&modules=startup&only=scripts&raw=1&skin=vector-2022"></script> <meta name="ResourceLoaderDynamicStyles" content=""> <link rel="stylesheet" href="/w/load.php?lang=en&modules=site.styles&only=styles&skin=vector-2022"> <meta name="generator" content="MediaWiki 1.44.0-wmf.4"> <meta name="referrer" content="origin"> <meta name="referrer" content="origin-when-cross-origin"> <meta name="robots" content="max-image-preview:standard"> <meta name="format-detection" content="telephone=no"> <meta name="viewport" content="width=1120"> <meta property="og:title" content="NIST hash function competition - Wikipedia"> <meta property="og:type" content="website"> <link rel="preconnect" href="//upload.wikimedia.org"> <link rel="alternate" media="only screen and (max-width: 640px)" href="//en.m.wikipedia.org/wiki/NIST_hash_function_competition"> <link rel="alternate" type="application/x-wiki" title="Edit this page" href="/w/index.php?title=NIST_hash_function_competition&action=edit"> <link rel="apple-touch-icon" href="/static/apple-touch/wikipedia.png"> <link rel="icon" href="/static/favicon/wikipedia.ico"> <link rel="search" type="application/opensearchdescription+xml" href="/w/rest.php/v1/search" title="Wikipedia (en)"> <link rel="EditURI" type="application/rsd+xml" href="//en.wikipedia.org/w/api.php?action=rsd"> <link rel="canonical" href="https://en.wikipedia.org/wiki/NIST_hash_function_competition"> <link rel="license" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en"> <link rel="alternate" type="application/atom+xml" title="Wikipedia Atom feed" href="/w/index.php?title=Special:RecentChanges&feed=atom"> <link rel="dns-prefetch" href="//meta.wikimedia.org" /> <link rel="dns-prefetch" href="//login.wikimedia.org"> </head> <body class="skin--responsive skin-vector skin-vector-search-vue mediawiki ltr sitedir-ltr mw-hide-empty-elt ns-0 ns-subject mw-editable page-NIST_hash_function_competition rootpage-NIST_hash_function_competition skin-vector-2022 action-view"><a class="mw-jump-link" href="#bodyContent">Jump to content</a> <div class="vector-header-container"> <header class="vector-header mw-header"> <div class="vector-header-start"> <nav class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-dropdown" class="vector-dropdown vector-main-menu-dropdown vector-button-flush-left vector-button-flush-right" > <input type="checkbox" id="vector-main-menu-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-main-menu-dropdown" class="vector-dropdown-checkbox " aria-label="Main menu" > <label id="vector-main-menu-dropdown-label" for="vector-main-menu-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-menu mw-ui-icon-wikimedia-menu"></span> <span class="vector-dropdown-label-text">Main menu</span> </label> <div class="vector-dropdown-content"> <div id="vector-main-menu-unpinned-container" class="vector-unpinned-container"> <div id="vector-main-menu" class="vector-main-menu vector-pinnable-element"> <div class="vector-pinnable-header vector-main-menu-pinnable-header vector-pinnable-header-unpinned" data-feature-name="main-menu-pinned" data-pinnable-element-id="vector-main-menu" data-pinned-container-id="vector-main-menu-pinned-container" data-unpinned-container-id="vector-main-menu-unpinned-container" > <div class="vector-pinnable-header-label">Main menu</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-main-menu.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-main-menu.unpin">hide</button> </div> <div id="p-navigation" class="vector-menu mw-portlet mw-portlet-navigation" > <div class="vector-menu-heading"> Navigation </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-mainpage-description" class="mw-list-item"><a href="/wiki/Main_Page" title="Visit the main page [z]" accesskey="z"><span>Main page</span></a></li><li id="n-contents" class="mw-list-item"><a href="/wiki/Wikipedia:Contents" title="Guides to browsing Wikipedia"><span>Contents</span></a></li><li id="n-currentevents" class="mw-list-item"><a href="/wiki/Portal:Current_events" title="Articles related to current events"><span>Current events</span></a></li><li id="n-randompage" class="mw-list-item"><a href="/wiki/Special:Random" title="Visit a randomly selected article [x]" accesskey="x"><span>Random article</span></a></li><li id="n-aboutsite" class="mw-list-item"><a href="/wiki/Wikipedia:About" title="Learn about Wikipedia and how it works"><span>About Wikipedia</span></a></li><li id="n-contactpage" class="mw-list-item"><a href="//en.wikipedia.org/wiki/Wikipedia:Contact_us" title="How to contact Wikipedia"><span>Contact us</span></a></li> </ul> </div> </div> <div id="p-interaction" class="vector-menu mw-portlet mw-portlet-interaction" > <div class="vector-menu-heading"> Contribute </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="n-help" class="mw-list-item"><a href="/wiki/Help:Contents" title="Guidance on how to use and edit Wikipedia"><span>Help</span></a></li><li id="n-introduction" class="mw-list-item"><a href="/wiki/Help:Introduction" title="Learn how to edit Wikipedia"><span>Learn to edit</span></a></li><li id="n-portal" class="mw-list-item"><a href="/wiki/Wikipedia:Community_portal" title="The hub for editors"><span>Community portal</span></a></li><li id="n-recentchanges" class="mw-list-item"><a href="/wiki/Special:RecentChanges" title="A list of recent changes to Wikipedia [r]" accesskey="r"><span>Recent changes</span></a></li><li id="n-upload" class="mw-list-item"><a href="/wiki/Wikipedia:File_upload_wizard" title="Add images or other media for use on Wikipedia"><span>Upload file</span></a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> <a href="/wiki/Main_Page" class="mw-logo"> <img class="mw-logo-icon" src="/static/images/icons/wikipedia.png" alt="" aria-hidden="true" height="50" width="50"> <span class="mw-logo-container skin-invert"> <img class="mw-logo-wordmark" alt="Wikipedia" src="/static/images/mobile/copyright/wikipedia-wordmark-en.svg" style="width: 7.5em; height: 1.125em;"> <img class="mw-logo-tagline" alt="The Free Encyclopedia" src="/static/images/mobile/copyright/wikipedia-tagline-en.svg" width="117" height="13" style="width: 7.3125em; height: 0.8125em;"> </span> </a> </div> <div class="vector-header-end"> <div id="p-search" role="search" class="vector-search-box-vue vector-search-box-collapses vector-search-box-show-thumbnail vector-search-box-auto-expand-width vector-search-box"> <a href="/wiki/Special:Search" class="cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only search-toggle" title="Search Wikipedia [f]" accesskey="f"><span class="vector-icon mw-ui-icon-search mw-ui-icon-wikimedia-search"></span> <span>Search</span> </a> <div class="vector-typeahead-search-container"> <div class="cdx-typeahead-search cdx-typeahead-search--show-thumbnail cdx-typeahead-search--auto-expand-width"> <form action="/w/index.php" id="searchform" class="cdx-search-input cdx-search-input--has-end-button"> <div id="simpleSearch" class="cdx-search-input__input-wrapper" data-search-loc="header-moved"> <div class="cdx-text-input cdx-text-input--has-start-icon"> <input class="cdx-text-input__input" type="search" name="search" placeholder="Search Wikipedia" aria-label="Search Wikipedia" autocapitalize="sentences" title="Search Wikipedia [f]" accesskey="f" id="searchInput" > <span class="cdx-text-input__icon cdx-text-input__start-icon"></span> </div> <input type="hidden" name="title" value="Special:Search"> </div> <button class="cdx-button cdx-search-input__end-button">Search</button> </form> </div> </div> </div> <nav class="vector-user-links vector-user-links-wide" aria-label="Personal tools"> <div class="vector-user-links-main"> <div id="p-vector-user-menu-preferences" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-userpage" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-dropdown" class="vector-dropdown " title="Change the appearance of the page's font size, width, and color" > <input type="checkbox" id="vector-appearance-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-appearance-dropdown" class="vector-dropdown-checkbox " aria-label="Appearance" > <label id="vector-appearance-dropdown-label" for="vector-appearance-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-appearance mw-ui-icon-wikimedia-appearance"></span> <span class="vector-dropdown-label-text">Appearance</span> </label> <div class="vector-dropdown-content"> <div id="vector-appearance-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <div id="p-vector-user-menu-notifications" class="vector-menu mw-portlet emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> <div id="p-vector-user-menu-overflow" class="vector-menu mw-portlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="https://donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&utm_medium=sidebar&utm_campaign=C13_en.wikipedia.org&uselang=en" class=""><span>Donate</span></a> </li> <li id="pt-createaccount-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:CreateAccount&returnto=NIST+hash+function+competition" title="You are encouraged to create an account and log in; however, it is not mandatory" class=""><span>Create account</span></a> </li> <li id="pt-login-2" class="user-links-collapsible-item mw-list-item user-links-collapsible-item"><a data-mw="interface" href="/w/index.php?title=Special:UserLogin&returnto=NIST+hash+function+competition" title="You're encouraged to log in; however, it's not mandatory. [o]" accesskey="o" class=""><span>Log in</span></a> </li> </ul> </div> </div> </div> <div id="vector-user-links-dropdown" class="vector-dropdown vector-user-menu vector-button-flush-right vector-user-menu-logged-out" title="Log in and more options" > <input type="checkbox" id="vector-user-links-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-user-links-dropdown" class="vector-dropdown-checkbox " aria-label="Personal tools" > <label id="vector-user-links-dropdown-label" for="vector-user-links-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-ellipsis mw-ui-icon-wikimedia-ellipsis"></span> <span class="vector-dropdown-label-text">Personal tools</span> </label> <div class="vector-dropdown-content"> <div id="p-personal" class="vector-menu mw-portlet mw-portlet-personal user-links-collapsible-item" title="User menu" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-sitesupport" class="user-links-collapsible-item mw-list-item"><a href="https://donate.wikimedia.org/wiki/Special:FundraiserRedirector?utm_source=donate&utm_medium=sidebar&utm_campaign=C13_en.wikipedia.org&uselang=en"><span>Donate</span></a></li><li id="pt-createaccount" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:CreateAccount&returnto=NIST+hash+function+competition" title="You are encouraged to create an account and log in; however, it is not mandatory"><span class="vector-icon mw-ui-icon-userAdd mw-ui-icon-wikimedia-userAdd"></span> <span>Create account</span></a></li><li id="pt-login" class="user-links-collapsible-item mw-list-item"><a href="/w/index.php?title=Special:UserLogin&returnto=NIST+hash+function+competition" title="You're encouraged to log in; however, it's not mandatory. [o]" accesskey="o"><span class="vector-icon mw-ui-icon-logIn mw-ui-icon-wikimedia-logIn"></span> <span>Log in</span></a></li> </ul> </div> </div> <div id="p-user-menu-anon-editor" class="vector-menu mw-portlet mw-portlet-user-menu-anon-editor" > <div class="vector-menu-heading"> Pages for logged out editors <a href="/wiki/Help:Introduction" aria-label="Learn more about editing"><span>learn more</span></a> </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="pt-anoncontribs" class="mw-list-item"><a href="/wiki/Special:MyContributions" title="A list of edits made from this IP address [y]" accesskey="y"><span>Contributions</span></a></li><li id="pt-anontalk" class="mw-list-item"><a href="/wiki/Special:MyTalk" title="Discussion about edits from this IP address [n]" accesskey="n"><span>Talk</span></a></li> </ul> </div> </div> </div> </div> </nav> </div> </header> </div> <div class="mw-page-container"> <div class="mw-page-container-inner"> <div class="vector-sitenotice-container"> <div id="siteNotice"></div> </div> <div class="vector-column-start"> <div class="vector-main-menu-container"> <div id="mw-navigation"> <nav id="mw-panel" class="vector-main-menu-landmark" aria-label="Site"> <div id="vector-main-menu-pinned-container" class="vector-pinned-container"> </div> </nav> </div> </div> <div class="vector-sticky-pinned-container"> <nav id="mw-panel-toc" aria-label="Contents" data-event-name="ui.sidebar-toc" class="mw-table-of-contents-container vector-toc-landmark"> <div id="vector-toc-pinned-container" class="vector-pinned-container"> <div id="vector-toc" class="vector-toc vector-pinnable-element"> <div class="vector-pinnable-header vector-toc-pinnable-header vector-pinnable-header-pinned" data-feature-name="toc-pinned" data-pinnable-element-id="vector-toc" > <h2 class="vector-pinnable-header-label">Contents</h2> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-toc.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-toc.unpin">hide</button> </div> <ul class="vector-toc-contents" id="mw-panel-toc-list"> <li id="toc-mw-content-text" class="vector-toc-list-item vector-toc-level-1"> <a href="#" class="vector-toc-link"> <div class="vector-toc-text">(Top)</div> </a> </li> <li id="toc-Process" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Process"> <div class="vector-toc-text"> <span class="vector-toc-numb">1</span> <span>Process</span> </div> </a> <ul id="toc-Process-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Entrants" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#Entrants"> <div class="vector-toc-text"> <span class="vector-toc-numb">2</span> <span>Entrants</span> </div> </a> <button aria-controls="toc-Entrants-sublist" class="cdx-button cdx-button--weight-quiet cdx-button--icon-only vector-toc-toggle"> <span class="vector-icon mw-ui-icon-wikimedia-expand"></span> <span>Toggle Entrants subsection</span> </button> <ul id="toc-Entrants-sublist" class="vector-toc-list"> <li id="toc-Winner" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Winner"> <div class="vector-toc-text"> <span class="vector-toc-numb">2.1</span> <span>Winner</span> </div> </a> <ul id="toc-Winner-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Finalists" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Finalists"> <div class="vector-toc-text"> <span class="vector-toc-numb">2.2</span> <span>Finalists</span> </div> </a> <ul id="toc-Finalists-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Did_not_pass_to_final_round" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Did_not_pass_to_final_round"> <div class="vector-toc-text"> <span class="vector-toc-numb">2.3</span> <span>Did not pass to final round</span> </div> </a> <ul id="toc-Did_not_pass_to_final_round-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Did_not_pass_to_round_two" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Did_not_pass_to_round_two"> <div class="vector-toc-text"> <span class="vector-toc-numb">2.4</span> <span>Did not pass to round two</span> </div> </a> <ul id="toc-Did_not_pass_to_round_two-sublist" class="vector-toc-list"> <li id="toc-Entrants_with_substantial_weaknesses" class="vector-toc-list-item vector-toc-level-3"> <a class="vector-toc-link" href="#Entrants_with_substantial_weaknesses"> <div class="vector-toc-text"> <span class="vector-toc-numb">2.4.1</span> <span>Entrants with substantial weaknesses</span> </div> </a> <ul id="toc-Entrants_with_substantial_weaknesses-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-Conceded_entrants" class="vector-toc-list-item vector-toc-level-3"> <a class="vector-toc-link" href="#Conceded_entrants"> <div class="vector-toc-text"> <span class="vector-toc-numb">2.4.2</span> <span>Conceded entrants</span> </div> </a> <ul id="toc-Conceded_entrants-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-Rejected_entrants" class="vector-toc-list-item vector-toc-level-2"> <a class="vector-toc-link" href="#Rejected_entrants"> <div class="vector-toc-text"> <span class="vector-toc-numb">2.5</span> <span>Rejected entrants</span> </div> </a> <ul id="toc-Rejected_entrants-sublist" class="vector-toc-list"> </ul> </li> </ul> </li> <li id="toc-See_also" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#See_also"> <div class="vector-toc-text"> <span class="vector-toc-numb">3</span> <span>See also</span> </div> </a> <ul id="toc-See_also-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-References" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#References"> <div class="vector-toc-text"> <span class="vector-toc-numb">4</span> <span>References</span> </div> </a> <ul id="toc-References-sublist" class="vector-toc-list"> </ul> </li> <li id="toc-External_links" class="vector-toc-list-item vector-toc-level-1 vector-toc-list-item-expanded"> <a class="vector-toc-link" href="#External_links"> <div class="vector-toc-text"> <span class="vector-toc-numb">5</span> <span>External links</span> </div> </a> <ul id="toc-External_links-sublist" class="vector-toc-list"> </ul> </li> </ul> </div> </div> </nav> </div> </div> <div class="mw-content-container"> <main id="content" class="mw-body"> <header class="mw-body-header vector-page-titlebar"> <nav aria-label="Contents" class="vector-toc-landmark"> <div id="vector-page-titlebar-toc" class="vector-dropdown vector-page-titlebar-toc vector-button-flush-left" > <input type="checkbox" id="vector-page-titlebar-toc-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-titlebar-toc" class="vector-dropdown-checkbox " aria-label="Toggle the table of contents" > <label id="vector-page-titlebar-toc-label" for="vector-page-titlebar-toc-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--icon-only " aria-hidden="true" ><span class="vector-icon mw-ui-icon-listBullet mw-ui-icon-wikimedia-listBullet"></span> <span class="vector-dropdown-label-text">Toggle the table of contents</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-titlebar-toc-unpinned-container" class="vector-unpinned-container"> </div> </div> </div> </nav> <h1 id="firstHeading" class="firstHeading mw-first-heading"><span class="mw-page-title-main">NIST hash function competition</span></h1> <div id="p-lang-btn" class="vector-dropdown mw-portlet mw-portlet-lang" > <input type="checkbox" id="p-lang-btn-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-p-lang-btn" class="vector-dropdown-checkbox mw-interlanguage-selector" aria-label="Go to an article in another language. Available in 4 languages" > <label id="p-lang-btn-label" for="p-lang-btn-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet cdx-button--action-progressive mw-portlet-lang-heading-4" aria-hidden="true" ><span class="vector-icon mw-ui-icon-language-progressive mw-ui-icon-wikimedia-language-progressive"></span> <span class="vector-dropdown-label-text">4 languages</span> </label> <div class="vector-dropdown-content"> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li class="interlanguage-link interwiki-fr mw-list-item"><a href="https://fr.wikipedia.org/wiki/NIST_hash_function_competition" title="NIST hash function competition – French" lang="fr" hreflang="fr" data-title="NIST hash function competition" data-language-autonym="Français" data-language-local-name="French" class="interlanguage-link-target"><span>Français</span></a></li><li class="interlanguage-link interwiki-it mw-list-item"><a href="https://it.wikipedia.org/wiki/Competizione_NIST_per_funzioni_hash" title="Competizione NIST per funzioni hash – Italian" lang="it" hreflang="it" data-title="Competizione NIST per funzioni hash" data-language-autonym="Italiano" data-language-local-name="Italian" class="interlanguage-link-target"><span>Italiano</span></a></li><li class="interlanguage-link interwiki-ru mw-list-item"><a href="https://ru.wikipedia.org/wiki/SHA-3_(%D0%BA%D0%BE%D0%BD%D0%BA%D1%83%D1%80%D1%81)" title="SHA-3 (конкурс) – Russian" lang="ru" hreflang="ru" data-title="SHA-3 (конкурс)" data-language-autonym="Русский" data-language-local-name="Russian" class="interlanguage-link-target"><span>Русский</span></a></li><li class="interlanguage-link interwiki-uk mw-list-item"><a href="https://uk.wikipedia.org/wiki/SHA-3_(%D0%BA%D0%BE%D0%BD%D0%BA%D1%83%D1%80%D1%81)" title="SHA-3 (конкурс) – Ukrainian" lang="uk" hreflang="uk" data-title="SHA-3 (конкурс)" data-language-autonym="Українська" data-language-local-name="Ukrainian" class="interlanguage-link-target"><span>Українська</span></a></li> </ul> <div class="after-portlet after-portlet-lang"><span class="wb-langlinks-edit wb-langlinks-link"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q15229223#sitelinks-wikipedia" title="Edit interlanguage links" class="wbc-editpage">Edit links</a></span></div> </div> </div> </div> </header> <div class="vector-page-toolbar"> <div class="vector-page-toolbar-container"> <div id="left-navigation"> <nav aria-label="Namespaces"> <div id="p-associated-pages" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-associated-pages" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-nstab-main" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/NIST_hash_function_competition" title="View the content page [c]" accesskey="c"><span>Article</span></a></li><li id="ca-talk" class="vector-tab-noicon mw-list-item"><a href="/wiki/Talk:NIST_hash_function_competition" rel="discussion" title="Discuss improvements to the content page [t]" accesskey="t"><span>Talk</span></a></li> </ul> </div> </div> <div id="vector-variants-dropdown" class="vector-dropdown emptyPortlet" > <input type="checkbox" id="vector-variants-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-variants-dropdown" class="vector-dropdown-checkbox " aria-label="Change language variant" > <label id="vector-variants-dropdown-label" for="vector-variants-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">English</span> </label> <div class="vector-dropdown-content"> <div id="p-variants" class="vector-menu mw-portlet mw-portlet-variants emptyPortlet" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> </ul> </div> </div> </div> </div> </nav> </div> <div id="right-navigation" class="vector-collapsible"> <nav aria-label="Views"> <div id="p-views" class="vector-menu vector-menu-tabs mw-portlet mw-portlet-views" > <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-view" class="selected vector-tab-noicon mw-list-item"><a href="/wiki/NIST_hash_function_competition"><span>Read</span></a></li><li id="ca-edit" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=NIST_hash_function_competition&action=edit" title="Edit this page [e]" accesskey="e"><span>Edit</span></a></li><li id="ca-history" class="vector-tab-noicon mw-list-item"><a href="/w/index.php?title=NIST_hash_function_competition&action=history" title="Past revisions of this page [h]" accesskey="h"><span>View history</span></a></li> </ul> </div> </div> </nav> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-dropdown" class="vector-dropdown vector-page-tools-dropdown" > <input type="checkbox" id="vector-page-tools-dropdown-checkbox" role="button" aria-haspopup="true" data-event-name="ui.dropdown-vector-page-tools-dropdown" class="vector-dropdown-checkbox " aria-label="Tools" > <label id="vector-page-tools-dropdown-label" for="vector-page-tools-dropdown-checkbox" class="vector-dropdown-label cdx-button cdx-button--fake-button cdx-button--fake-button--enabled cdx-button--weight-quiet" aria-hidden="true" ><span class="vector-dropdown-label-text">Tools</span> </label> <div class="vector-dropdown-content"> <div id="vector-page-tools-unpinned-container" class="vector-unpinned-container"> <div id="vector-page-tools" class="vector-page-tools vector-pinnable-element"> <div class="vector-pinnable-header vector-page-tools-pinnable-header vector-pinnable-header-unpinned" data-feature-name="page-tools-pinned" data-pinnable-element-id="vector-page-tools" data-pinned-container-id="vector-page-tools-pinned-container" data-unpinned-container-id="vector-page-tools-unpinned-container" > <div class="vector-pinnable-header-label">Tools</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-page-tools.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-page-tools.unpin">hide</button> </div> <div id="p-cactions" class="vector-menu mw-portlet mw-portlet-cactions emptyPortlet vector-has-collapsible-items" title="More options" > <div class="vector-menu-heading"> Actions </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="ca-more-view" class="selected vector-more-collapsible-item mw-list-item"><a href="/wiki/NIST_hash_function_competition"><span>Read</span></a></li><li id="ca-more-edit" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=NIST_hash_function_competition&action=edit" title="Edit this page [e]" accesskey="e"><span>Edit</span></a></li><li id="ca-more-history" class="vector-more-collapsible-item mw-list-item"><a href="/w/index.php?title=NIST_hash_function_competition&action=history"><span>View history</span></a></li> </ul> </div> </div> <div id="p-tb" class="vector-menu mw-portlet mw-portlet-tb" > <div class="vector-menu-heading"> General </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-whatlinkshere" class="mw-list-item"><a href="/wiki/Special:WhatLinksHere/NIST_hash_function_competition" title="List of all English Wikipedia pages containing links to this page [j]" accesskey="j"><span>What links here</span></a></li><li id="t-recentchangeslinked" class="mw-list-item"><a href="/wiki/Special:RecentChangesLinked/NIST_hash_function_competition" rel="nofollow" title="Recent changes in pages linked from this page [k]" accesskey="k"><span>Related changes</span></a></li><li id="t-upload" class="mw-list-item"><a href="/wiki/Wikipedia:File_Upload_Wizard" title="Upload files [u]" accesskey="u"><span>Upload file</span></a></li><li id="t-specialpages" class="mw-list-item"><a href="/wiki/Special:SpecialPages" title="A list of all special pages [q]" accesskey="q"><span>Special pages</span></a></li><li id="t-permalink" class="mw-list-item"><a href="/w/index.php?title=NIST_hash_function_competition&oldid=1210884072" title="Permanent link to this revision of this page"><span>Permanent link</span></a></li><li id="t-info" class="mw-list-item"><a href="/w/index.php?title=NIST_hash_function_competition&action=info" title="More information about this page"><span>Page information</span></a></li><li id="t-cite" class="mw-list-item"><a href="/w/index.php?title=Special:CiteThisPage&page=NIST_hash_function_competition&id=1210884072&wpFormIdentifier=titleform" title="Information on how to cite this page"><span>Cite this page</span></a></li><li id="t-urlshortener" class="mw-list-item"><a href="/w/index.php?title=Special:UrlShortener&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FNIST_hash_function_competition"><span>Get shortened URL</span></a></li><li id="t-urlshortener-qrcode" class="mw-list-item"><a href="/w/index.php?title=Special:QrCode&url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FNIST_hash_function_competition"><span>Download QR code</span></a></li> </ul> </div> </div> <div id="p-coll-print_export" class="vector-menu mw-portlet mw-portlet-coll-print_export" > <div class="vector-menu-heading"> Print/export </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="coll-download-as-rl" class="mw-list-item"><a href="/w/index.php?title=Special:DownloadAsPdf&page=NIST_hash_function_competition&action=show-download-screen" title="Download this page as a PDF file"><span>Download as PDF</span></a></li><li id="t-print" class="mw-list-item"><a href="/w/index.php?title=NIST_hash_function_competition&printable=yes" title="Printable version of this page [p]" accesskey="p"><span>Printable version</span></a></li> </ul> </div> </div> <div id="p-wikibase-otherprojects" class="vector-menu mw-portlet mw-portlet-wikibase-otherprojects" > <div class="vector-menu-heading"> In other projects </div> <div class="vector-menu-content"> <ul class="vector-menu-content-list"> <li id="t-wikibase" class="wb-otherproject-link wb-otherproject-wikibase-dataitem mw-list-item"><a href="https://www.wikidata.org/wiki/Special:EntityPage/Q15229223" title="Structured data on this page hosted by Wikidata [g]" accesskey="g"><span>Wikidata item</span></a></li> </ul> </div> </div> </div> </div> </div> </div> </nav> </div> </div> </div> <div class="vector-column-end"> <div class="vector-sticky-pinned-container"> <nav class="vector-page-tools-landmark" aria-label="Page tools"> <div id="vector-page-tools-pinned-container" class="vector-pinned-container"> </div> </nav> <nav class="vector-appearance-landmark" aria-label="Appearance"> <div id="vector-appearance-pinned-container" class="vector-pinned-container"> <div id="vector-appearance" class="vector-appearance vector-pinnable-element"> <div class="vector-pinnable-header vector-appearance-pinnable-header vector-pinnable-header-pinned" data-feature-name="appearance-pinned" data-pinnable-element-id="vector-appearance" data-pinned-container-id="vector-appearance-pinned-container" data-unpinned-container-id="vector-appearance-unpinned-container" > <div class="vector-pinnable-header-label">Appearance</div> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-pin-button" data-event-name="pinnable-header.vector-appearance.pin">move to sidebar</button> <button class="vector-pinnable-header-toggle-button vector-pinnable-header-unpin-button" data-event-name="pinnable-header.vector-appearance.unpin">hide</button> </div> </div> </div> </nav> </div> </div> <div id="bodyContent" class="vector-body" aria-labelledby="firstHeading" data-mw-ve-target-container> <div class="vector-body-before-content"> <div class="mw-indicators"> </div> <div id="siteSub" class="noprint">From Wikipedia, the free encyclopedia</div> </div> <div id="contentSub"><div id="mw-content-subtitle"></div></div> <div id="mw-content-text" class="mw-body-content"><div class="mw-content-ltr mw-parser-output" lang="en" dir="ltr"><p class="mw-empty-elt"> </p> <div class="shortdescription nomobile noexcerpt noprint searchaux" style="display:none">Competition to develop SHA-3</div> <p class="mw-empty-elt"> </p><p>The <b>NIST hash function competition</b> was an open competition held by the US <a href="/wiki/National_Institute_of_Standards_and_Technology" title="National Institute of Standards and Technology">National Institute of Standards and Technology</a> (NIST) to develop a new <a href="/wiki/Hash_function" title="Hash function">hash function</a> called <a href="/wiki/SHA-3" title="SHA-3">SHA-3</a> to complement the older <a href="/wiki/SHA-1" title="SHA-1">SHA-1</a> and <a href="/wiki/SHA-2" title="SHA-2">SHA-2</a>. The competition was formally announced in the <i><a href="/wiki/Federal_Register" title="Federal Register">Federal Register</a></i> on November 2, 2007.<sup id="cite_ref-1" class="reference"><a href="#cite_note-1"><span class="cite-bracket">[</span>1<span class="cite-bracket">]</span></a></sup> "NIST is initiating an effort to develop one or more additional hash algorithms through a public competition, similar to the <a href="/wiki/Advanced_Encryption_Standard_process" title="Advanced Encryption Standard process">development process</a> for the <a href="/wiki/Advanced_Encryption_Standard" title="Advanced Encryption Standard">Advanced Encryption Standard</a> (AES)."<sup id="cite_ref-2" class="reference"><a href="#cite_note-2"><span class="cite-bracket">[</span>2<span class="cite-bracket">]</span></a></sup> The competition ended on October 2, 2012, when NIST announced that <a href="/wiki/Keccak" class="mw-redirect" title="Keccak">Keccak</a> would be the new SHA-3 hash algorithm.<sup id="cite_ref-NIST_3-0" class="reference"><a href="#cite_note-NIST-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup> </p><p>The winning hash function has been published as NIST FIPS 202 the "SHA-3 Standard", to complement FIPS 180-4, the <i><a href="/wiki/Secure_Hash_Standard" class="mw-redirect" title="Secure Hash Standard">Secure Hash Standard</a></i>. </p><p>The NIST competition has inspired other competitions such as the <a href="/wiki/Password_Hashing_Competition" title="Password Hashing Competition">Password Hashing Competition</a>. </p> <meta property="mw:PageProp/toc" /> <div class="mw-heading mw-heading2"><h2 id="Process">Process</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=1" title="Edit section: Process"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Submissions were due October 31, 2008 and the list of candidates accepted for the first round was published on December 9, 2008.<sup id="cite_ref-Round1_4-0" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> 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.<sup id="cite_ref-5" class="reference"><a href="#cite_note-5"><span class="cite-bracket">[</span>5<span class="cite-bracket">]</span></a></sup> The list of 14 candidates accepted to Round 2 was published on July 24, 2009.<sup id="cite_ref-Round2_6-0" class="reference"><a href="#cite_note-Round2-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup> Another conference was held on August 23–24, 2010 (after <a href="/wiki/International_Cryptology_Conference" class="mw-redirect" title="International Cryptology Conference">CRYPTO</a> 2010) at the <a href="/wiki/University_of_California,_Santa_Barbara" title="University of California, Santa Barbara">University of California, Santa Barbara</a>, where the second-round candidates were discussed.<sup id="cite_ref-conference2_7-0" class="reference"><a href="#cite_note-conference2-7"><span class="cite-bracket">[</span>7<span class="cite-bracket">]</span></a></sup> The announcement of the final round candidates occurred on December 10, 2010.<sup id="cite_ref-8" class="reference"><a href="#cite_note-8"><span class="cite-bracket">[</span>8<span class="cite-bracket">]</span></a></sup> On October 2, 2012, NIST announced its winner, choosing <a href="/wiki/Keccak" class="mw-redirect" title="Keccak">Keccak</a>, created by Guido Bertoni, Joan Daemen, and Gilles Van Assche of STMicroelectronics and Michaël Peeters of NXP.<sup id="cite_ref-NIST_3-1" class="reference"><a href="#cite_note-NIST-3"><span class="cite-bracket">[</span>3<span class="cite-bracket">]</span></a></sup> </p> <div class="mw-heading mw-heading2"><h2 id="Entrants">Entrants</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=2" title="Edit section: Entrants"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>This is an incomplete list of known submissions. NIST selected 51 entries for round 1.<sup id="cite_ref-Round1_4-1" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> 14 of them advanced to round 2,<sup id="cite_ref-Round2_6-1" class="reference"><a href="#cite_note-Round2-6"><span class="cite-bracket">[</span>6<span class="cite-bracket">]</span></a></sup> from which 5 finalists were selected. </p> <div class="mw-heading mw-heading3"><h3 id="Winner">Winner</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=3" title="Edit section: Winner"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>The winner was announced to be <a href="/wiki/Keccak" class="mw-redirect" title="Keccak">Keccak</a> on October 2, 2012.<sup id="cite_ref-9" class="reference"><a href="#cite_note-9"><span class="cite-bracket">[</span>9<span class="cite-bracket">]</span></a></sup> </p> <div class="mw-heading mw-heading3"><h3 id="Finalists">Finalists</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=4" title="Edit section: Finalists"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>NIST selected five SHA-3 candidate algorithms to advance to the third (and final) round:<sup id="cite_ref-10" class="reference"><a href="#cite_note-10"><span class="cite-bracket">[</span>10<span class="cite-bracket">]</span></a></sup> </p> <ul><li><a href="/wiki/BLAKE_(hash_function)" title="BLAKE (hash function)">BLAKE</a> (Aumasson et al.)</li> <li><a href="/wiki/Gr%C3%B8stl" title="Grøstl">Grøstl</a> (<a href="/wiki/Lars_Knudsen" class="mw-redirect" title="Lars Knudsen">Knudsen</a> et al.)</li> <li><a href="/wiki/JH_(hash_function)" title="JH (hash function)">JH</a> (Hongjun Wu)</li> <li><a href="/wiki/Keccak" class="mw-redirect" title="Keccak">Keccak</a> (Keccak team, <a href="/wiki/Joan_Daemen" title="Joan Daemen">Daemen</a> et al.)</li> <li><a href="/wiki/Skein_(hash_function)" title="Skein (hash function)">Skein</a> (<a href="/wiki/Bruce_Schneier" title="Bruce Schneier">Schneier</a> et al.)</li></ul> <p>NIST noted some factors that figured into its selection as it announced the finalists:<sup id="cite_ref-11" class="reference"><a href="#cite_note-11"><span class="cite-bracket">[</span>11<span class="cite-bracket">]</span></a></sup> </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="/wiki/Cryptanalysis" title="Cryptanalysis">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="/wiki/Sponge_function" title="Sponge function">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.<sup id="cite_ref-12" class="reference"><a href="#cite_note-12"><span class="cite-bracket">[</span>12<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-13" class="reference"><a href="#cite_note-13"><span class="cite-bracket">[</span>13<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-14" class="reference"><a href="#cite_note-14"><span class="cite-bracket">[</span>14<span class="cite-bracket">]</span></a></sup> </p> <div class="mw-heading mw-heading3"><h3 id="Did_not_pass_to_final_round">Did not pass to final round</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=5" title="Edit section: Did not pass to final round"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <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> <style data-mw-deduplicate="TemplateStyles:r1184024115">.mw-parser-output .div-col{margin-top:0.3em;column-width:30em}.mw-parser-output .div-col-small{font-size:90%}.mw-parser-output .div-col-rules{column-rule:1px solid #aaa}.mw-parser-output .div-col dl,.mw-parser-output .div-col ol,.mw-parser-output .div-col ul{margin-top:0}.mw-parser-output .div-col li,.mw-parser-output .div-col dd{page-break-inside:avoid;break-inside:avoid-column}</style><div class="div-col" style="column-width: 22em;"> <ul><li>Blue Midnight Wish<sup id="cite_ref-15" class="reference"><a href="#cite_note-15"><span class="cite-bracket">[</span>15<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-16" class="reference"><a href="#cite_note-16"><span class="cite-bracket">[</span>16<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/CubeHash" title="CubeHash">CubeHash</a> (<a href="/wiki/Daniel_J._Bernstein" title="Daniel J. Bernstein">Bernstein</a>)</li> <li>ECHO (<a href="/wiki/France_Telecom" class="mw-redirect" title="France Telecom">France Telecom</a>)<sup id="cite_ref-17" class="reference"><a href="#cite_note-17"><span class="cite-bracket">[</span>17<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Fugue_(hash_function)" title="Fugue (hash function)">Fugue</a> (<a href="/wiki/IBM" title="IBM">IBM</a>)</li> <li>Hamsi<sup id="cite_ref-18" class="reference"><a href="#cite_note-18"><span class="cite-bracket">[</span>18<span class="cite-bracket">]</span></a></sup></li> <li>Luffa<sup id="cite_ref-19" class="reference"><a href="#cite_note-19"><span class="cite-bracket">[</span>19<span class="cite-bracket">]</span></a></sup></li> <li>Shabal<sup id="cite_ref-20" class="reference"><a href="#cite_note-20"><span class="cite-bracket">[</span>20<span class="cite-bracket">]</span></a></sup></li> <li>SHAvite-3<sup id="cite_ref-21" class="reference"><a href="#cite_note-21"><span class="cite-bracket">[</span>21<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/SIMD_(hash_function)" title="SIMD (hash function)">SIMD</a></li></ul> </div> <div class="mw-heading mw-heading3"><h3 id="Did_not_pass_to_round_two">Did not pass to round two</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=6" title="Edit section: Did not pass to round two"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <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> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1184024115"><div class="div-col" style="column-width: 22em;"> <ul><li>ARIRANG<sup id="cite_ref-22" class="reference"><a href="#cite_note-22"><span class="cite-bracket">[</span>22<span class="cite-bracket">]</span></a></sup> (CIST – Korea University)</li> <li>CHI<sup id="cite_ref-23" class="reference"><a href="#cite_note-23"><span class="cite-bracket">[</span>23<span class="cite-bracket">]</span></a></sup></li> <li>CRUNCH<sup id="cite_ref-24" class="reference"><a href="#cite_note-24"><span class="cite-bracket">[</span>24<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Fast_Syndrome_Based_Hash" class="mw-redirect" title="Fast Syndrome Based Hash">FSB</a></li> <li><a href="/wiki/Lane_(hash_function)" title="Lane (hash function)">Lane</a></li> <li>Lesamnta<sup id="cite_ref-25" class="reference"><a href="#cite_note-25"><span class="cite-bracket">[</span>25<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/MD6" title="MD6">MD6</a> (<a href="/wiki/Ron_Rivest" title="Ron Rivest">Rivest</a> et al.)</li> <li><a href="/wiki/SANDstorm" class="mw-redirect" title="SANDstorm">SANDstorm</a> (<a href="/wiki/Sandia_National_Laboratories" title="Sandia National Laboratories">Sandia National Laboratories</a>)</li> <li>Sarmal<sup id="cite_ref-26" class="reference"><a href="#cite_note-26"><span class="cite-bracket">[</span>26<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/SWIFFT" title="SWIFFT">SWIFFT</a>X</li> <li>TIB3<sup id="cite_ref-27" class="reference"><a href="#cite_note-27"><span class="cite-bracket">[</span>27<span class="cite-bracket">]</span></a></sup></li></ul> </div> <div class="mw-heading mw-heading4"><h4 id="Entrants_with_substantial_weaknesses">Entrants with substantial weaknesses</h4><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=7" title="Edit section: Entrants with substantial weaknesses"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>The following non-conceded round one entrants have had substantial cryptographic weaknesses announced: </p> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1184024115"><div class="div-col" style="column-width: 22em;"> <ul><li>AURORA (<a href="/wiki/Sony" title="Sony">Sony</a> and <a href="/wiki/Nagoya_University" title="Nagoya University">Nagoya University</a>)<sup id="cite_ref-28" class="reference"><a href="#cite_note-28"><span class="cite-bracket">[</span>28<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-29" class="reference"><a href="#cite_note-29"><span class="cite-bracket">[</span>29<span class="cite-bracket">]</span></a></sup></li> <li>Blender<sup id="cite_ref-30" class="reference"><a href="#cite_note-30"><span class="cite-bracket">[</span>30<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-31" class="reference"><a href="#cite_note-31"><span class="cite-bracket">[</span>31<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-32" class="reference"><a href="#cite_note-32"><span class="cite-bracket">[</span>32<span class="cite-bracket">]</span></a></sup></li> <li>Cheetah<sup id="cite_ref-33" class="reference"><a href="#cite_note-33"><span class="cite-bracket">[</span>33<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-34" class="reference"><a href="#cite_note-34"><span class="cite-bracket">[</span>34<span class="cite-bracket">]</span></a></sup></li> <li>Dynamic SHA<sup id="cite_ref-35" class="reference"><a href="#cite_note-35"><span class="cite-bracket">[</span>35<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-36" class="reference"><a href="#cite_note-36"><span class="cite-bracket">[</span>36<span class="cite-bracket">]</span></a></sup></li> <li>Dynamic SHA2<sup id="cite_ref-37" class="reference"><a href="#cite_note-37"><span class="cite-bracket">[</span>37<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-38" class="reference"><a href="#cite_note-38"><span class="cite-bracket">[</span>38<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Elliptic_curve_only_hash" title="Elliptic curve only hash">ECOH</a></li> <li>Edon-R<sup id="cite_ref-39" class="reference"><a href="#cite_note-39"><span class="cite-bracket">[</span>39<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-40" class="reference"><a href="#cite_note-40"><span class="cite-bracket">[</span>40<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/EnRUPT" title="EnRUPT">EnRUPT</a><sup id="cite_ref-41" class="reference"><a href="#cite_note-41"><span class="cite-bracket">[</span>41<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-42" class="reference"><a href="#cite_note-42"><span class="cite-bracket">[</span>42<span class="cite-bracket">]</span></a></sup></li> <li>ESSENCE<sup id="cite_ref-43" class="reference"><a href="#cite_note-43"><span class="cite-bracket">[</span>43<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-44" class="reference"><a href="#cite_note-44"><span class="cite-bracket">[</span>44<span class="cite-bracket">]</span></a></sup></li> <li>LUX<sup id="cite_ref-45" class="reference"><a href="#cite_note-45"><span class="cite-bracket">[</span>45<span class="cite-bracket">]</span></a></sup></li> <li>MCSSHA-3<sup id="cite_ref-46" class="reference"><a href="#cite_note-46"><span class="cite-bracket">[</span>46<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-47" class="reference"><a href="#cite_note-47"><span class="cite-bracket">[</span>47<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/NaSHA_(hash_function)" class="mw-redirect" title="NaSHA (hash function)">NaSHA</a></li> <li>Sgàil<sup id="cite_ref-48" class="reference"><a href="#cite_note-48"><span class="cite-bracket">[</span>48<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-49" class="reference"><a href="#cite_note-49"><span class="cite-bracket">[</span>49<span class="cite-bracket">]</span></a></sup></li> <li><a href="/wiki/Spectral_Hash" title="Spectral Hash">Spectral Hash</a></li> <li>Twister<sup id="cite_ref-50" class="reference"><a href="#cite_note-50"><span class="cite-bracket">[</span>50<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-51" class="reference"><a href="#cite_note-51"><span class="cite-bracket">[</span>51<span class="cite-bracket">]</span></a></sup></li> <li>Vortex<sup id="cite_ref-52" class="reference"><a href="#cite_note-52"><span class="cite-bracket">[</span>52<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-53" class="reference"><a href="#cite_note-53"><span class="cite-bracket">[</span>53<span class="cite-bracket">]</span></a></sup></li></ul> </div> <div class="mw-heading mw-heading4"><h4 id="Conceded_entrants">Conceded entrants</h4><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=8" title="Edit section: Conceded entrants"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <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.<sup id="cite_ref-54" class="reference"><a href="#cite_note-54"><span class="cite-bracket">[</span>54<span class="cite-bracket">]</span></a></sup> As such, they are withdrawn from the competition. </p> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1184024115"><div class="div-col" style="column-width: 22em;"> <ul><li>Abacus<sup id="cite_ref-Round1_4-2" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-55" class="reference"><a href="#cite_note-55"><span class="cite-bracket">[</span>55<span class="cite-bracket">]</span></a></sup></li> <li>Boole<sup id="cite_ref-56" class="reference"><a href="#cite_note-56"><span class="cite-bracket">[</span>56<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-57" class="reference"><a href="#cite_note-57"><span class="cite-bracket">[</span>57<span class="cite-bracket">]</span></a></sup></li> <li>DCH<sup id="cite_ref-Round1_4-3" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-58" class="reference"><a href="#cite_note-58"><span class="cite-bracket">[</span>58<span class="cite-bracket">]</span></a></sup></li> <li>Khichidi-1<sup id="cite_ref-Round1_4-4" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-59" class="reference"><a href="#cite_note-59"><span class="cite-bracket">[</span>59<span class="cite-bracket">]</span></a></sup></li> <li>MeshHash<sup id="cite_ref-Round1_4-5" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-60" class="reference"><a href="#cite_note-60"><span class="cite-bracket">[</span>60<span class="cite-bracket">]</span></a></sup></li> <li>SHAMATA<sup id="cite_ref-Round1_4-6" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-61" class="reference"><a href="#cite_note-61"><span class="cite-bracket">[</span>61<span class="cite-bracket">]</span></a></sup></li> <li>StreamHash<sup id="cite_ref-Round1_4-7" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-62" class="reference"><a href="#cite_note-62"><span class="cite-bracket">[</span>62<span class="cite-bracket">]</span></a></sup></li> <li>Tangle<sup id="cite_ref-Round1_4-8" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-63" class="reference"><a href="#cite_note-63"><span class="cite-bracket">[</span>63<span class="cite-bracket">]</span></a></sup></li> <li>WaMM<sup id="cite_ref-64" class="reference"><a href="#cite_note-64"><span class="cite-bracket">[</span>64<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-65" class="reference"><a href="#cite_note-65"><span class="cite-bracket">[</span>65<span class="cite-bracket">]</span></a></sup></li> <li>Waterfall<sup id="cite_ref-66" class="reference"><a href="#cite_note-66"><span class="cite-bracket">[</span>66<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-67" class="reference"><a href="#cite_note-67"><span class="cite-bracket">[</span>67<span class="cite-bracket">]</span></a></sup></li></ul> </div> <div class="mw-heading mw-heading3"><h3 id="Rejected_entrants">Rejected entrants</h3><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=9" title="Edit section: Rejected entrants"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <p>Several submissions received by NIST were not accepted as first-round candidates, following an internal review by NIST.<sup id="cite_ref-Round1_4-9" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup> 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,<sup id="cite_ref-Round1_4-10" class="reference"><a href="#cite_note-Round1-4"><span class="cite-bracket">[</span>4<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-68" class="reference"><a href="#cite_note-68"><span class="cite-bracket">[</span>68<span class="cite-bracket">]</span></a></sup> but only the following are public. </p> <link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1184024115"><div class="div-col" style="column-width: 22em;"> <ul><li>HASH 2X<sup class="noprint Inline-Template Template-Fact" style="white-space:nowrap;">[<i><a href="/wiki/Wikipedia:Citation_needed" title="Wikipedia:Citation needed"><span title="This claim needs references to reliable sources. (May 2018)">citation needed</span></a></i>]</sup></li> <li>Maraca<sup id="cite_ref-69" class="reference"><a href="#cite_note-69"><span class="cite-bracket">[</span>69<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-70" class="reference"><a href="#cite_note-70"><span class="cite-bracket">[</span>70<span class="cite-bracket">]</span></a></sup></li> <li>MIXIT<sup id="cite_ref-71" class="reference"><a href="#cite_note-71"><span class="cite-bracket">[</span>71<span class="cite-bracket">]</span></a></sup></li> <li>NKS 2D<sup id="cite_ref-72" class="reference"><a href="#cite_note-72"><span class="cite-bracket">[</span>72<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-73" class="reference"><a href="#cite_note-73"><span class="cite-bracket">[</span>73<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-74" class="reference"><a href="#cite_note-74"><span class="cite-bracket">[</span>74<span class="cite-bracket">]</span></a></sup></li> <li>Ponic<sup id="cite_ref-75" class="reference"><a href="#cite_note-75"><span class="cite-bracket">[</span>75<span class="cite-bracket">]</span></a></sup><sup id="cite_ref-76" class="reference"><a href="#cite_note-76"><span class="cite-bracket">[</span>76<span class="cite-bracket">]</span></a></sup></li> <li>ZK-Crypt<sup id="cite_ref-77" class="reference"><a href="#cite_note-77"><span class="cite-bracket">[</span>77<span class="cite-bracket">]</span></a></sup></li></ul> </div> <div class="mw-heading mw-heading2"><h2 id="See_also">See also</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=10" title="Edit section: See also"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a href="/wiki/Advanced_Encryption_Standard_process" title="Advanced Encryption Standard process">Advanced Encryption Standard process</a></li> <li><a href="/wiki/CAESAR_Competition" title="CAESAR Competition">CAESAR Competition</a> – Competition to design authenticated encryption schemes</li> <li><a href="/wiki/Post-Quantum_Cryptography_Standardization" class="mw-redirect" title="Post-Quantum Cryptography Standardization">Post-Quantum Cryptography Standardization</a></li></ul> <div class="mw-heading mw-heading2"><h2 id="References">References</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=11" title="Edit section: References"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <style data-mw-deduplicate="TemplateStyles:r1239543626">.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}</style><div class="reflist reflist-columns references-column-width" style="column-width: 30em;"> <ol class="references"> <li id="cite_note-1"><span class="mw-cite-backlink"><b><a href="#cite_ref-1">^</a></b></span> <span class="reference-text"><style data-mw-deduplicate="TemplateStyles:r1238218222">.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/6/65/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/d/d6/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/a/aa/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/4/4c/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}</style><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/documents/FR_Notice_Nov07.pdf">"Federal Register / Vol. 72, No. 212"</a> <span class="cs1-format">(PDF)</span>. <i>Federal Register</i>. Government Printing Office. November 2, 2007<span class="reference-accessdate">. Retrieved <span class="nowrap">November 6,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=Federal+Register&rft.atitle=Federal+Register+%2F+Vol.+72%2C+No.+212&rft.date=2007-11-02&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Fdocuments%2FFR_Notice_Nov07.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-2"><span class="mw-cite-backlink"><b><a href="#cite_ref-2">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/index.html">"cryptographic hash project – Background Information"</a>. <i>Computer Security Resource Center</i>. National Institute of Standards and Technology. November 2, 2007<span class="reference-accessdate">. Retrieved <span class="nowrap">November 6,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=Computer+Security+Resource+Center&rft.atitle=cryptographic+hash+project+%E2%80%93+Background+Information&rft.date=2007-11-02&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Findex.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-NIST-3"><span class="mw-cite-backlink">^ <a href="#cite_ref-NIST_3-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-NIST_3-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.nist.gov/itl/csd/sha-100212.cfm">"NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition"</a>. NIST. October 2, 2012<span class="reference-accessdate">. Retrieved <span class="nowrap">October 2,</span> 2012</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=NIST+Selects+Winner+of+Secure+Hash+Algorithm+%28SHA-3%29+Competition&rft.pub=NIST&rft.date=2012-10-02&rft_id=https%3A%2F%2Fwww.nist.gov%2Fitl%2Fcsd%2Fsha-100212.cfm&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-Round1-4"><span class="mw-cite-backlink">^ <a href="#cite_ref-Round1_4-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Round1_4-1"><sup><i><b>b</b></i></sup></a> <a href="#cite_ref-Round1_4-2"><sup><i><b>c</b></i></sup></a> <a href="#cite_ref-Round1_4-3"><sup><i><b>d</b></i></sup></a> <a href="#cite_ref-Round1_4-4"><sup><i><b>e</b></i></sup></a> <a href="#cite_ref-Round1_4-5"><sup><i><b>f</b></i></sup></a> <a href="#cite_ref-Round1_4-6"><sup><i><b>g</b></i></sup></a> <a href="#cite_ref-Round1_4-7"><sup><i><b>h</b></i></sup></a> <a href="#cite_ref-Round1_4-8"><sup><i><b>i</b></i></sup></a> <a href="#cite_ref-Round1_4-9"><sup><i><b>j</b></i></sup></a> <a href="#cite_ref-Round1_4-10"><sup><i><b>k</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/index.html">"Round 1"</a>. December 9, 2008<span class="reference-accessdate">. Retrieved <span class="nowrap">December 10,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Round+1&rft.date=2008-12-09&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Fsha-3%2FRound1%2Findex.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-5"><span class="mw-cite-backlink"><b><a href="#cite_ref-5">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNational_Institute_of_Standards_and_Technology2008" class="citation web cs1">National Institute of Standards and Technology (December 9, 2008). <a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/Feb2009/index.html">"The First SHA-3 Candidate Conference"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">December 23,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+First+SHA-3+Candidate+Conference&rft.date=2008-12-09&rft.au=National+Institute+of+Standards+and+Technology&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Fsha-3%2FRound1%2FFeb2009%2Findex.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-Round2-6"><span class="mw-cite-backlink">^ <a href="#cite_ref-Round2_6-0"><sup><i><b>a</b></i></sup></a> <a href="#cite_ref-Round2_6-1"><sup><i><b>b</b></i></sup></a></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/submissions_rnd2.html">"Second Round Candidates"</a>. National Institute for Standards and Technology. July 24, 2009<span class="reference-accessdate">. Retrieved <span class="nowrap">July 24,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Second+Round+Candidates&rft.pub=National+Institute+for+Standards+and+Technology&rft.date=2009-07-24&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Fsha-3%2FRound2%2Fsubmissions_rnd2.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-conference2-7"><span class="mw-cite-backlink"><b><a href="#cite_ref-conference2_7-0">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNational_Institute_of_Standards_and_Technology2010" class="citation web cs1">National Institute of Standards and Technology (June 30, 2010). <a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/Aug2010/">"The Second SHA-3 Candidate Conference"</a>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+Second+SHA-3+Candidate+Conference&rft.date=2010-06-30&rft.au=National+Institute+of+Standards+and+Technology&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Fsha-3%2FRound2%2FAug2010%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-8"><span class="mw-cite-backlink"><b><a href="#cite_ref-8">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/timeline.html">"Tentative Timeline of the Development of New Hash Functions"</a>. NIST. December 10, 2008<span class="reference-accessdate">. Retrieved <span class="nowrap">September 15,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Tentative+Timeline+of+the+Development+of+New+Hash+Functions&rft.pub=NIST&rft.date=2008-12-10&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Ftimeline.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-9"><span class="mw-cite-backlink"><b><a href="#cite_ref-9">^</a></b></span> <span class="reference-text"><a rel="nofollow" class="external text" href="https://www.nist.gov/itl/csd/sha-100212.cfm">NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition</a></span> </li> <li id="cite_note-10"><span class="mw-cite-backlink"><b><a href="#cite_ref-10">^</a></b></span> <span class="reference-text"><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round3/submissions_rnd3.html">Third (Final) Round Candidates</a> Retrieved 9 Nov 2011</span> </li> <li id="cite_note-11"><span class="mw-cite-backlink"><b><a href="#cite_ref-11">^</a></b></span> <span class="reference-text"><a rel="nofollow" class="external text" href="http://crypto.junod.info/2010/12/10/sha-3-finalists-announced-by-nist/">SHA-3 Finalists Announced by NIST</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20110709093032/http://crypto.junod.info/2010/12/10/sha-3-finalists-announced-by-nist/">Archived</a> July 9, 2011, at the <a href="/wiki/Wayback_Machine" title="Wayback Machine">Wayback Machine</a>, blog post quoting NIST's announcement in full.</span> </li> <li id="cite_note-12"><span class="mw-cite-backlink"><b><a href="#cite_ref-12">^</a></b></span> <span class="reference-text"><a rel="nofollow" class="external text" href="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</a> (PDF).</span> </li> <li id="cite_note-13"><span class="mw-cite-backlink"><b><a href="#cite_ref-13">^</a></b></span> <span class="reference-text"><a rel="nofollow" class="external text" href="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</a> (PDF). Retrieved 2 March 2011</span> </li> <li id="cite_note-14"><span class="mw-cite-backlink"><b><a href="#cite_ref-14">^</a></b></span> <span class="reference-text"><a rel="nofollow" class="external text" href="http://nvlpubs.nist.gov/nistpubs/ir/2012/NIST.IR.7896.pdf">Third-Round Report of the SHA-3 Cryptographic Hash Algorithm Competition</a> (PDF).</span> </li> <li id="cite_note-15"><span class="mw-cite-backlink"><b><a href="#cite_ref-15">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSvein_Johan_KnapskogDanilo_GligoroskiVlastimil_KlimaMohamed_El-Hadedy2008" class="citation web cs1">Svein Johan Knapskog; Danilo Gligoroski; Vlastimil Klima; Mohamed El-Hadedy; Jørn Amundsen; Stig Frode Mjølsnes (November 4, 2008). <a rel="nofollow" class="external text" href="http://www.item.ntnu.no/people/personalpages/fac/danilog/blue_midnight_wish">"blue_midnight_wish"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">November 10,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=blue_midnight_wish&rft.date=2008-11-04&rft.au=Svein+Johan+Knapskog&rft.au=Danilo+Gligoroski&rft.au=Vlastimil+Klima&rft.au=Mohamed+El-Hadedy&rft.au=J%C3%B8rn+Amundsen&rft.au=Stig+Frode+Mj%C3%B8lsnes&rft_id=http%3A%2F%2Fwww.item.ntnu.no%2Fpeople%2Fpersonalpages%2Ffac%2Fdanilog%2Fblue_midnight_wish&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-16"><span class="mw-cite-backlink"><b><a href="#cite_ref-16">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSøren_S._Thomsen2009" class="citation web cs1">Søren S. Thomsen (2009). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090902193808/http://www2.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf">"Pseudo-cryptanalysis of Blue Midnight Wish"</a> <span class="cs1-format">(PDF)</span>. Archived from <a rel="nofollow" class="external text" href="http://www.mat.dtu.dk/people/S.Thomsen/bmw/bmw-pseudo.pdf">the original</a> <span class="cs1-format">(PDF)</span> on September 2, 2009<span class="reference-accessdate">. Retrieved <span class="nowrap">May 19,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Pseudo-cryptanalysis+of+Blue+Midnight+Wish&rft.date=2009&rft.au=S%C3%B8ren+S.+Thomsen&rft_id=http%3A%2F%2Fwww.mat.dtu.dk%2Fpeople%2FS.Thomsen%2Fbmw%2Fbmw-pseudo.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-17"><span class="mw-cite-backlink"><b><a href="#cite_ref-17">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHenri_GilbertRyad_BenadjilaOlivier_BilletGilles_Macario-Rat2008" class="citation web cs1">Henri Gilbert; Ryad Benadjila; Olivier Billet; Gilles Macario-Rat; Thomas Peyrin; Matt Robshaw; Yannick Seurin (October 29, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/9/91/Echo.pdf">"SHA-3 Proposal: ECHO"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=SHA-3+Proposal%3A+ECHO&rft.date=2008-10-29&rft.au=Henri+Gilbert&rft.au=Ryad+Benadjila&rft.au=Olivier+Billet&rft.au=Gilles+Macario-Rat&rft.au=Thomas+Peyrin&rft.au=Matt+Robshaw&rft.au=Yannick+Seurin&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F9%2F91%2FEcho.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-18"><span class="mw-cite-backlink"><b><a href="#cite_ref-18">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFÖzgül_Kücük2008" class="citation web cs1">Özgül Kücük (October 31, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/9/95/Hamsi.pdf">"The Hash Function Hamsi"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+Hash+Function+Hamsi&rft.date=2008-10-31&rft.au=%C3%96zg%C3%BCl+K%C3%BCc%C3%BCk&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F9%2F95%2FHamsi.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-19"><span class="mw-cite-backlink"><b><a href="#cite_ref-19">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDai_WatanabeChristophe_De_CanniereHisayoshi_Sato2008" class="citation web cs1">Dai Watanabe; Christophe De Canniere; Hisayoshi Sato (October 31, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/e/ea/Luffa_Specification.pdf">"Hash Function Luffa: Specification"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Hash+Function+Luffa%3A+Specification&rft.date=2008-10-31&rft.au=Dai+Watanabe&rft.au=Christophe+De+Canniere&rft.au=Hisayoshi+Sato&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Fe%2Fea%2FLuffa_Specification.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-20"><span class="mw-cite-backlink"><b><a href="#cite_ref-20">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJean-François_MisarskyEmmanuel_BressonAnne_CanteautBenoît_Chevallier-Mames2008" class="citation web cs1">Jean-François Misarsky; Emmanuel Bresson; <a href="/wiki/Anne_Canteaut" title="Anne Canteaut">Anne Canteaut</a>; Benoît Chevallier-Mames; Christophe Clavier; Thomas Fuhr; <a href="/wiki/Aline_Gouget" title="Aline Gouget">Aline Gouget</a>; 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). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/6/6c/Shabal.pdf">"Shabal, a Submission to NIST's Cryptographic Hash Algorithm Competition"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Shabal%2C+a+Submission+to+NIST%27s+Cryptographic+Hash+Algorithm+Competition&rft.date=2008-10-28&rft.au=Jean-Fran%C3%A7ois+Misarsky&rft.au=Emmanuel+Bresson&rft.au=Anne+Canteaut&rft.au=Beno%C3%AEt+Chevallier-Mames&rft.au=Christophe+Clavier&rft.au=Thomas+Fuhr&rft.au=Aline+Gouget&rft.au=Thomas+Icart&rft.au=Jean-Fran%C3%A7ois+Misarsky&rft.au=Mar%C3%ACa+Naya-Plasencia&rft.au=Pascal+Paillier&rft.au=Thomas+Pornin&rft.au=Jean-Ren%C3%A9+Reinhard&rft.au=C%C3%A9line+Thuillet&rft.au=Marion+Videau&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F6%2F6c%2FShabal.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-21"><span class="mw-cite-backlink"><b><a href="#cite_ref-21">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFEli_BihamOrr_Dunkelman" class="citation web cs1">Eli Biham; Orr Dunkelman. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/f/f5/Shavite.pdf">"The SHAvite-3 Hash Function"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+SHAvite-3+Hash+Function&rft.au=Eli+Biham&rft.au=Orr+Dunkelman&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Ff%2Ff5%2FShavite.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-22"><span class="mw-cite-backlink"><b><a href="#cite_ref-22">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJongin_LimDonghoon_ChangSeokhie_HongChangheon_Kang2008" class="citation web cs1">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). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/2/2c/Arirang.pdf">"ARIRANG"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=ARIRANG&rft.date=2008-10-29&rft.au=Jongin+Lim&rft.au=Donghoon+Chang&rft.au=Seokhie+Hong&rft.au=Changheon+Kang&rft.au=Jinkeon+Kang&rft.au=Jongsung+Kim&rft.au=Changhoon+Lee&rft.au=Jesang+Lee&rft.au=Jongtae+Lee&rft.au=Sangjin+Lee&rft.au=Yuseop+Lee&rft.au=Jaechul+Sung&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F2%2F2c%2FArirang.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-23"><span class="mw-cite-backlink"><b><a href="#cite_ref-23">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPhilip_HawkesCameron_McDonald2008" class="citation web cs1">Philip Hawkes; Cameron McDonald (October 30, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/2/2c/Chi_submission.pdf">"Submission to the SHA-3 Competition: The CHI Family of Cryptographic Hash Algorithms"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Submission+to+the+SHA-3+Competition%3A+The+CHI+Family+of+Cryptographic+Hash+Algorithms&rft.date=2008-10-30&rft.au=Philip+Hawkes&rft.au=Cameron+McDonald&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F2%2F2c%2FChi_submission.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-24"><span class="mw-cite-backlink"><b><a href="#cite_ref-24">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJacques_PatarinLouis_GoubinMickael_IvascotWilliam_Jalby" class="citation web cs1">Jacques Patarin; Louis Goubin; Mickael Ivascot; William Jalby; Olivier Ly; Valerie Nachef; Joana Treger; Emmanuel Volte. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090129125541/http://voltee.com/crunch/">"CRUNCH"</a>. Archived from <a rel="nofollow" class="external text" href="http://www.voltee.com/crunch/">the original</a> on January 29, 2009<span class="reference-accessdate">. Retrieved <span class="nowrap">November 14,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=CRUNCH&rft.au=Jacques+Patarin&rft.au=Louis+Goubin&rft.au=Mickael+Ivascot&rft.au=William+Jalby&rft.au=Olivier+Ly&rft.au=Valerie+Nachef&rft.au=Joana+Treger&rft.au=Emmanuel+Volte&rft_id=http%3A%2F%2Fwww.voltee.com%2Fcrunch%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-25"><span class="mw-cite-backlink"><b><a href="#cite_ref-25">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFHirotaka_YoshidaShoichi_HiroseHidenori_Kuwakado2008" class="citation web cs1">Hirotaka Yoshida; Shoichi Hirose; Hidenori Kuwakado (October 30, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/5/5c/Lesamnta.pdf">"SHA-3 Proposal: Lesamnta"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=SHA-3+Proposal%3A+Lesamnta&rft.date=2008-10-30&rft.au=Hirotaka+Yoshida&rft.au=Shoichi+Hirose&rft.au=Hidenori+Kuwakado&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F5%2F5c%2FLesamnta.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-26"><span class="mw-cite-backlink"><b><a href="#cite_ref-26">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFKerem_VarıcıOnur_ÖzenÇelebi_Kocair" class="citation web cs1">Kerem Varıcı; Onur Özen; Çelebi Kocair. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20110611091218/http://homes.esat.kuleuven.be/~kvarici/sarmal_hash.html">"The Sarmal Hash Function"</a>. Archived from <a rel="nofollow" class="external text" href="http://homes.esat.kuleuven.be/~kvarici/sarmal_hash.html">the original</a> on June 11, 2011<span class="reference-accessdate">. Retrieved <span class="nowrap">October 12,</span> 2010</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+Sarmal+Hash+Function&rft.au=Kerem+Var%C4%B1c%C4%B1&rft.au=Onur+%C3%96zen&rft.au=%C3%87elebi+Kocair&rft_id=http%3A%2F%2Fhomes.esat.kuleuven.be%2F~kvarici%2Fsarmal_hash.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-27"><span class="mw-cite-backlink"><b><a href="#cite_ref-27">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDaniel_PenazziMiguel_Montes" class="citation web cs1">Daniel Penazzi; Miguel Montes. <a rel="nofollow" class="external text" href="http://www.famaf.unc.edu.ar/~penazzi/tib3/submitted/Supporting_Documentation/TIB3_Algorithm_Specification.pdf">"The TIB3 Hash"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 29,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+TIB3+Hash&rft.au=Daniel+Penazzi&rft.au=Miguel+Montes&rft_id=http%3A%2F%2Fwww.famaf.unc.edu.ar%2F~penazzi%2Ftib3%2Fsubmitted%2FSupporting_Documentation%2FTIB3_Algorithm_Specification.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span><sup class="noprint Inline-Template"><span style="white-space: nowrap;">[<i><a href="/wiki/Wikipedia:Link_rot" title="Wikipedia:Link rot"><span title=" Dead link tagged February 2018">permanent dead link</span></a></i><span style="visibility:hidden; color:transparent; padding-left:2px">‍</span>]</span></sup></span> </li> <li id="cite_note-28"><span class="mw-cite-backlink"><b><a href="#cite_ref-28">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFTetsu_IwataKyoji_ShibutaniTaizo_ShiraiShiho_Moriai2008" class="citation web cs1">Tetsu Iwata; Kyoji Shibutani; Taizo Shirai; Shiho Moriai; Toru Akishita (October 31, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/b/ba/AURORA.pdf">"AURORA: A Cryptographic Hash Algorithm Family"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=AURORA%3A+A+Cryptographic+Hash+Algorithm+Family&rft.date=2008-10-31&rft.au=Tetsu+Iwata&rft.au=Kyoji+Shibutani&rft.au=Taizo+Shirai&rft.au=Shiho+Moriai&rft.au=Toru+Akishita&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Fb%2Fba%2FAURORA.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-29"><span class="mw-cite-backlink"><b><a href="#cite_ref-29">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNiels_FergusonStefan_Lucks2009" class="citation web cs1"><a href="/wiki/Niels_Ferguson" title="Niels Ferguson">Niels Ferguson</a>; <a href="/wiki/Stefan_Lucks" title="Stefan Lucks">Stefan Lucks</a> (2009). <a rel="nofollow" class="external text" href="http://eprint.iacr.org/2009/113.pdf">"Attacks on AURORA-512 and the Double-MIX Merkle–Damgård Transform"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">July 10,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Attacks+on+AURORA-512+and+the+Double-MIX+Merkle%E2%80%93Damg%C3%A5rd+Transform&rft.date=2009&rft.au=Niels+Ferguson&rft.au=Stefan+Lucks&rft_id=http%3A%2F%2Feprint.iacr.org%2F2009%2F113.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-30"><span class="mw-cite-backlink"><b><a href="#cite_ref-30">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFColin_Bradbury2008" class="citation web cs1">Colin Bradbury (October 25, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/5/5e/Blender.pdf">"BLENDER: A Proposed New Family of Cryptographic Hash Algorithms"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=BLENDER%3A+A+Proposed+New+Family+of+Cryptographic+Hash+Algorithms&rft.date=2008-10-25&rft.au=Colin+Bradbury&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F5%2F5e%2FBlender.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-31"><span class="mw-cite-backlink"><b><a href="#cite_ref-31">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCraig_Newbold" class="citation web cs1">Craig Newbold. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/2/20/Observations_on_Blender.pdf">"Observations and Attacks On The SHA-3 Candidate Blender"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 23,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Observations+and+Attacks+On+The+SHA-3+Candidate+Blender&rft.au=Craig+Newbold&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F2%2F20%2FObservations_on_Blender.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-32"><span class="mw-cite-backlink"><b><a href="#cite_ref-32">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFFlorian_Mendel" class="citation web cs1">Florian Mendel. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/4/48/Blender-preimage.pdf">"Preimage Attack on Blender"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 23,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Preimage+Attack+on+Blender&rft.au=Florian+Mendel&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F4%2F48%2FBlender-preimage.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-33"><span class="mw-cite-backlink"><b><a href="#cite_ref-33">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDmitry_KhovratovichAlex_BiryukovIvica_Nikolić2008" class="citation web cs1">Dmitry Khovratovich; Alex Biryukov; Ivica Nikolić (October 30, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/c/ca/Cheetah.pdf">"The Hash Function Cheetah: Specification and Supporting Documentation"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+Hash+Function+Cheetah%3A+Specification+and+Supporting+Documentation&rft.date=2008-10-30&rft.au=Dmitry+Khovratovich&rft.au=Alex+Biryukov&rft.au=Ivica+Nikoli%C4%87&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Fc%2Fca%2FCheetah.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-34"><span class="mw-cite-backlink"><b><a href="#cite_ref-34">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDanilo_Gligoroski2008" class="citation web cs1">Danilo Gligoroski (December 12, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/d/d9/Cheetah_length-extension.txt">"Danilo Gligoroski – Cheetah hash function is not resistant against length-extension attack"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">December 21,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Danilo+Gligoroski+%E2%80%93+Cheetah+hash+function+is+not+resistant+against+length-extension+attack&rft.date=2008-12-12&rft.au=Danilo+Gligoroski&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Fd%2Fd9%2FCheetah_length-extension.txt&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-35"><span class="mw-cite-backlink"><b><a href="#cite_ref-35">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFZijie_Xu" class="citation web cs1">Zijie Xu. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/e/e2/DyamicSHA.pdf">"Dynamic SHA"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Dynamic+SHA&rft.au=Zijie+Xu&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Fe%2Fe2%2FDyamicSHA.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-36"><span class="mw-cite-backlink"><b><a href="#cite_ref-36">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFVlastimil_Klima2008" class="citation web cs1">Vlastimil Klima (December 14, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/e/e7/Dynamic-sha_length-extension.txt">"Dynamic SHA is vulnerable to generic attacks"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">December 21,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Dynamic+SHA+is+vulnerable+to+generic+attacks&rft.date=2008-12-14&rft.au=Vlastimil+Klima&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Fe%2Fe7%2FDynamic-sha_length-extension.txt&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-37"><span class="mw-cite-backlink"><b><a href="#cite_ref-37">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFZijie_Xu" class="citation web cs1">Zijie Xu. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/5/5b/DyamicSHA2.pdf">"Dynamic SHA2"</a> <span class="cs1-format">(PDF)</span>. NIST<span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Dynamic+SHA2&rft.pub=NIST&rft.au=Zijie+Xu&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F5%2F5b%2FDyamicSHA2.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-38"><span class="mw-cite-backlink"><b><a href="#cite_ref-38">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFVlastimil_Klima2008" class="citation web cs1">Vlastimil Klima (December 14, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/0/0e/Dynamic-sha2_length-extension.txt">"Dynamic SHA2 is vulnerable to generic attacks"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">December 21,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Dynamic+SHA2+is+vulnerable+to+generic+attacks&rft.date=2008-12-14&rft.au=Vlastimil+Klima&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F0%2F0e%2FDynamic-sha2_length-extension.txt&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-39"><span class="mw-cite-backlink"><b><a href="#cite_ref-39">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDanilo_GligoroskiRune_Steinsmo_ØdegårdMarija_MihovaSvein_Johan_Knapskog2008" class="citation web cs1">Danilo Gligoroski; Rune Steinsmo Ødegård; Marija Mihova; Svein Johan Knapskog; Ljupco Kocarev; Aleš Drápal (November 4, 2008). <a rel="nofollow" class="external text" href="http://www.item.ntnu.no/people/personalpages/fac/danilog/edon-r">"edon-r"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">November 10,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=edon-r&rft.date=2008-11-04&rft.au=Danilo+Gligoroski&rft.au=Rune+Steinsmo+%C3%98deg%C3%A5rd&rft.au=Marija+Mihova&rft.au=Svein+Johan+Knapskog&rft.au=Ljupco+Kocarev&rft.au=Ale%C5%A1+Dr%C3%A1pal&rft_id=http%3A%2F%2Fwww.item.ntnu.no%2Fpeople%2Fpersonalpages%2Ffac%2Fdanilog%2Fedon-r&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-40"><span class="mw-cite-backlink"><b><a href="#cite_ref-40">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDmitry_KhovratovichIvica_NikolićRalf-Philipp_Weinmann2008" class="citation web cs1">Dmitry Khovratovich; Ivica Nikolić; Ralf-Philipp Weinmann (2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/7/74/Edon.pdf">"Cryptanalysis of Edon-R"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">July 10,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Cryptanalysis+of+Edon-R&rft.date=2008&rft.au=Dmitry+Khovratovich&rft.au=Ivica+Nikoli%C4%87&rft.au=Ralf-Philipp+Weinmann&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F7%2F74%2FEdon.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-41"><span class="mw-cite-backlink"><b><a href="#cite_ref-41">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSean_O'NeilKarsten_NohlLuca_Henzen2008" class="citation web cs1">Sean O'Neil; Karsten Nohl; Luca Henzen (October 31, 2008). <a rel="nofollow" class="external text" href="http://www.enrupt.com/">"EnRUPT – The Simpler The Better"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">November 10,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=EnRUPT+%E2%80%93+The+Simpler+The+Better&rft.date=2008-10-31&rft.au=Sean+O%27Neil&rft.au=Karsten+Nohl&rft.au=Luca+Henzen&rft_id=http%3A%2F%2Fwww.enrupt.com%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-42"><span class="mw-cite-backlink"><b><a href="#cite_ref-42">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFSebastiaan_Indesteege2008" class="citation web cs1">Sebastiaan Indesteege (November 6, 2008). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090218093632/http://homes.esat.kuleuven.be/~sindeste/enrupt.html">"Collisions for EnRUPT"</a>. Archived from <a rel="nofollow" class="external text" href="http://homes.esat.kuleuven.be/~sindeste/enrupt.html">the original</a> on February 18, 2009<span class="reference-accessdate">. Retrieved <span class="nowrap">November 7,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Collisions+for+EnRUPT&rft.date=2008-11-06&rft.au=Sebastiaan+Indesteege&rft_id=http%3A%2F%2Fhomes.esat.kuleuven.be%2F~sindeste%2Fenrupt.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-43"><span class="mw-cite-backlink"><b><a href="#cite_ref-43">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJason_Worth_Martin2008" class="citation web cs1">Jason Worth Martin (October 21, 2008). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20100612084041/http://www.math.jmu.edu/~martin/essence/Supporting_Documentation/essence_NIST.pdf">"ESSENCE: A Candidate Hashing Algorithm for the NIST Competition"</a> <span class="cs1-format">(PDF)</span>. Archived from <a rel="nofollow" class="external text" href="http://www.math.jmu.edu/~martin/essence/Supporting_Documentation/essence_NIST.pdf">the original</a> <span class="cs1-format">(PDF)</span> on June 12, 2010<span class="reference-accessdate">. Retrieved <span class="nowrap">November 8,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=ESSENCE%3A+A+Candidate+Hashing+Algorithm+for+the+NIST+Competition&rft.date=2008-10-21&rft.au=Jason+Worth+Martin&rft_id=http%3A%2F%2Fwww.math.jmu.edu%2F~martin%2Fessence%2FSupporting_Documentation%2Fessence_NIST.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-44"><span class="mw-cite-backlink"><b><a href="#cite_ref-44">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://www.131002.net/data/papers/NRALLMP09.pdf">"Cryptanalysis of ESSENCE"</a> <span class="cs1-format">(PDF)</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Cryptanalysis+of+ESSENCE&rft_id=http%3A%2F%2Fwww.131002.net%2Fdata%2Fpapers%2FNRALLMP09.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-45"><span class="mw-cite-backlink"><b><a href="#cite_ref-45">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFIvica_NikolićAlex_BiryukovDmitry_Khovratovich" class="citation web cs1">Ivica Nikolić; Alex Biryukov; Dmitry Khovratovich. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/f/f3/LUX.pdf">"Hash family LUX – Algorithm Specifications and Supporting Documentation"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Hash+family+LUX+%E2%80%93+Algorithm+Specifications+and+Supporting+Documentation&rft.au=Ivica+Nikoli%C4%87&rft.au=Alex+Biryukov&rft.au=Dmitry+Khovratovich&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Ff%2Ff3%2FLUX.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-46"><span class="mw-cite-backlink"><b><a href="#cite_ref-46">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMikhail_Maslennikov" class="citation web cs1">Mikhail Maslennikov. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090502224350/http://registercsp.nets.co.kr/hash_competition.htm">"MCSSHA-3 hash algorithm"</a>. Archived from <a rel="nofollow" class="external text" href="http://registercsp.nets.co.kr/hash_competition.htm">the original</a> on May 2, 2009<span class="reference-accessdate">. Retrieved <span class="nowrap">November 8,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=MCSSHA-3+hash+algorithm&rft.au=Mikhail+Maslennikov&rft_id=http%3A%2F%2Fregistercsp.nets.co.kr%2Fhash_competition.htm&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-47"><span class="mw-cite-backlink"><b><a href="#cite_ref-47">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJean-Philippe_AumassonMaría_Naya-Plasencia" class="citation web cs1">Jean-Philippe Aumasson; María Naya-Plasencia. <a rel="nofollow" class="external text" href="http://131002.net/data/papers/AN.pdf">"Second preimages on MCSSHA-3"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 14,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Second+preimages+on+MCSSHA-3&rft.au=Jean-Philippe+Aumasson&rft.au=Mar%C3%ADa+Naya-Plasencia&rft_id=http%3A%2F%2F131002.net%2Fdata%2Fpapers%2FAN.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span><sup class="noprint Inline-Template"><span style="white-space: nowrap;">[<i><a href="/wiki/Wikipedia:Link_rot" title="Wikipedia:Link rot"><span title=" Dead link tagged February 2018">permanent dead link</span></a></i><span style="visibility:hidden; color:transparent; padding-left:2px">‍</span>]</span></sup></span> </li> <li id="cite_note-48"><span class="mw-cite-backlink"><b><a href="#cite_ref-48">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPeter_Maxwell2008" class="citation web cs1">Peter Maxwell (September 2008). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20131112211946/http://www.allicient.co.uk/files/sgail/Supporting_Documentation/specification.pdf">"The Sgàil Cryptographic Hash Function"</a> <span class="cs1-format">(PDF)</span>. Archived from <a rel="nofollow" class="external text" href="http://www.allicient.co.uk/files/sgail/Supporting_Documentation/specification.pdf">the original</a> <span class="cs1-format">(PDF)</span> on November 12, 2013<span class="reference-accessdate">. Retrieved <span class="nowrap">November 9,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+Sg%C3%A0il+Cryptographic+Hash+Function&rft.date=2008-09&rft.au=Peter+Maxwell&rft_id=http%3A%2F%2Fwww.allicient.co.uk%2Ffiles%2Fsgail%2FSupporting_Documentation%2Fspecification.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-49"><span class="mw-cite-backlink"><b><a href="#cite_ref-49">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPeter_Maxwell2008" class="citation web cs1">Peter Maxwell (November 5, 2008). <a rel="nofollow" class="external text" href="https://web.archive.org/web/20081109065226/http://www.allicient.co.uk/2008/11/05/aww-psh/">"Aww, p*sh!"</a>. Archived from <a rel="nofollow" class="external text" href="http://www.allicient.co.uk/2008/11/05/aww-psh/">the original</a> on November 9, 2008<span class="reference-accessdate">. Retrieved <span class="nowrap">November 6,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Aww%2C+p%2Ash%21&rft.date=2008-11-05&rft.au=Peter+Maxwell&rft_id=http%3A%2F%2Fwww.allicient.co.uk%2F2008%2F11%2F05%2Faww-psh%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-50"><span class="mw-cite-backlink"><b><a href="#cite_ref-50">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMichael_GorskiEwan_FleischmannChristian_Forler2008" class="citation web cs1">Michael Gorski; Ewan Fleischmann; Christian Forler (October 28, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/3/39/Twister.pdf">"The Twister Hash Function Family"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+Twister+Hash+Function+Family&rft.date=2008-10-28&rft.au=Michael+Gorski&rft.au=Ewan+Fleischmann&rft.au=Christian+Forler&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F3%2F39%2FTwister.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-51"><span class="mw-cite-backlink"><b><a href="#cite_ref-51">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFFlorian_MendelChristian_RechbergerMartin_Schläffer2008" class="citation web cs1">Florian Mendel; Christian Rechberger; Martin Schläffer (2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/d/dd/Twister_attack.pdf">"Cryptanalysis of Twister"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">May 19,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Cryptanalysis+of+Twister&rft.date=2008&rft.au=Florian+Mendel&rft.au=Christian+Rechberger&rft.au=Martin+Schl%C3%A4ffer&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Fd%2Fdd%2FTwister_attack.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-52"><span class="mw-cite-backlink"><b><a href="#cite_ref-52">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMichael_KounavisShay_Gueron2008" class="citation web cs1">Michael Kounavis; Shay Gueron (November 3, 2008). <a rel="nofollow" class="external text" href="http://eprint.iacr.org/2008/464">"Vortex: A New Family of One Way Hash Functions based on Rijndael Rounds and Carry-less Multiplication"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">November 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Vortex%3A+A+New+Family+of+One+Way+Hash+Functions+based+on+Rijndael+Rounds+and+Carry-less+Multiplication&rft.date=2008-11-03&rft.au=Michael+Kounavis&rft.au=Shay+Gueron&rft_id=http%3A%2F%2Feprint.iacr.org%2F2008%2F464&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-53"><span class="mw-cite-backlink"><b><a href="#cite_ref-53">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJean-Philippe_AumassonOrr_DunkelmanFlorian_MendelChristian_Rechberger2009" class="citation web cs1">Jean-Philippe Aumasson; Orr Dunkelman; Florian Mendel; Christian Rechberger; Søren S. Thomsen (2009). <a rel="nofollow" class="external text" href="http://www.131002.net/data/papers/ADMRT09.pdf">"Cryptanalysis of Vortex"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">May 19,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Cryptanalysis+of+Vortex&rft.date=2009&rft.au=Jean-Philippe+Aumasson&rft.au=Orr+Dunkelman&rft.au=Florian+Mendel&rft.au=Christian+Rechberger&rft.au=S%C3%B8ren+S.+Thomsen&rft_id=http%3A%2F%2Fwww.131002.net%2Fdata%2Fpapers%2FADMRT09.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-54"><span class="mw-cite-backlink"><b><a href="#cite_ref-54">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFComputer_Security_Division2017" class="citation web cs1">Computer Security Division, Information Technology Laboratory (January 4, 2017). <a rel="nofollow" class="external text" href="https://csrc.nist.gov/projects/hash-functions/sha-3-project">"SHA-3 Project – Hash Functions"</a>. <i>CSRC: NIST</i><span class="reference-accessdate">. Retrieved <span class="nowrap">April 26,</span> 2019</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=unknown&rft.jtitle=CSRC%3A+NIST&rft.atitle=SHA-3+Project+%E2%80%93+Hash+Functions&rft.date=2017-01-04&rft.aulast=Computer+Security+Division&rft.aufirst=Information+Technology+Laboratory&rft_id=https%3A%2F%2Fcsrc.nist.gov%2Fprojects%2Fhash-functions%2Fsha-3-project&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-55"><span class="mw-cite-backlink"><b><a href="#cite_ref-55">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNeil_Sholer2008" class="citation web cs1">Neil Sholer (October 29, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/b/be/Abacus.pdf">"Abacus: A Candidate for SHA-3"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Abacus%3A+A+Candidate+for+SHA-3&rft.date=2008-10-29&rft.au=Neil+Sholer&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Fb%2Fbe%2FAbacus.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-56"><span class="mw-cite-backlink"><b><a href="#cite_ref-56">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGregory_G._Rose" class="citation web cs1">Gregory G. Rose. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/3/37/BoolePaper.pdf">"Design and Primitive Specification for Boole"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 8,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Design+and+Primitive+Specification+for+Boole&rft.au=Gregory+G.+Rose&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F3%2F37%2FBoolePaper.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-57"><span class="mw-cite-backlink"><b><a href="#cite_ref-57">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGregory_G._Rose2008" class="citation web cs1">Gregory G. Rose (December 10, 2008). <a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/BOOLE_Comments.pdf">"Official Comment: Boole"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 23,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Official+Comment%3A+Boole&rft.date=2008-12-10&rft.au=Gregory+G.+Rose&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Fsha-3%2FRound1%2Fdocuments%2FBOOLE_Comments.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-58"><span class="mw-cite-backlink"><b><a href="#cite_ref-58">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFDavid_A._Wilson2008" class="citation web cs1">David A. Wilson (October 23, 2008). <a rel="nofollow" class="external text" href="http://web.mit.edu/dwilson/www/hash/dch/Supporting_Documentation/dch.pdf">"The DCH Hash Function"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 23,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+DCH+Hash+Function&rft.date=2008-10-23&rft.au=David+A.+Wilson&rft_id=http%3A%2F%2Fweb.mit.edu%2Fdwilson%2Fwww%2Fhash%2Fdch%2FSupporting_Documentation%2Fdch.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-59"><span class="mw-cite-backlink"><b><a href="#cite_ref-59">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNatarajan_Vijayarangan" class="citation web cs1">Natarajan Vijayarangan. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/d/d4/Khichidi-1.pdf">"A New Hash Algorithm: Khichidi-1"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=A+New+Hash+Algorithm%3A+Khichidi-1&rft.au=Natarajan+Vijayarangan&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2Fd%2Fd4%2FKhichidi-1.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-60"><span class="mw-cite-backlink"><b><a href="#cite_ref-60">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBjörn_Fay" class="citation web cs1">Björn Fay. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/5/5a/Specification_DIN-A4.pdf">"MeshHash"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 30,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=MeshHash&rft.au=Bj%C3%B6rn+Fay&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F5%2F5a%2FSpecification_DIN-A4.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-61"><span class="mw-cite-backlink"><b><a href="#cite_ref-61">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFOrhun_KaraAdem_AtalayFerhat_KarakocCevat_Manap" class="citation web cs1">Orhun Kara; Adem Atalay; Ferhat Karakoc; Cevat Manap. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090201153442/http://www.uekae.tubitak.gov.tr/home.do?ot=1&sid=601&pid=547">"SHAMATA hash function: A candidate algorithm for NIST competition"</a>. Archived from <a rel="nofollow" class="external text" href="http://www.uekae.tubitak.gov.tr/home.do?ot=1&sid=601&pid=547">the original</a> on February 1, 2009<span class="reference-accessdate">. Retrieved <span class="nowrap">November 10,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=SHAMATA+hash+function%3A+A+candidate+algorithm+for+NIST+competition&rft.au=Orhun+Kara&rft.au=Adem+Atalay&rft.au=Ferhat+Karakoc&rft.au=Cevat+Manap&rft_id=http%3A%2F%2Fwww.uekae.tubitak.gov.tr%2Fhome.do%3Fot%3D1%26sid%3D601%26pid%3D547&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-62"><span class="mw-cite-backlink"><b><a href="#cite_ref-62">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMichal_Trojnara2008" class="citation web cs1">Michal Trojnara (October 14, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/0/09/Streamhash.pdf">"StreamHash Algorithm Specifications and Supporting Documentation"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 15,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=StreamHash+Algorithm+Specifications+and+Supporting+Documentation&rft.date=2008-10-14&rft.au=Michal+Trojnara&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F0%2F09%2FStreamhash.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-63"><span class="mw-cite-backlink"><b><a href="#cite_ref-63">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFRafael_AlvarezGary_McGuireAntonio_Zamora" class="citation web cs1">Rafael Alvarez; Gary McGuire; Antonio Zamora. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/4/40/Tangle.pdf">"The Tangle Hash Function"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 11,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=The+Tangle+Hash+Function&rft.au=Rafael+Alvarez&rft.au=Gary+McGuire&rft.au=Antonio+Zamora&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F4%2F40%2FTangle.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-64"><span class="mw-cite-backlink"><b><a href="#cite_ref-64">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFJohn_Washburn" class="citation web cs1">John Washburn. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090419085817/http://www.washburnresearch.org/cryptography/archive/WaMM-SHA3.pdf">"WaMM: A Candidate Algorithm for the SHA-3 Competition"</a> <span class="cs1-format">(PDF)</span>. Archived from <a rel="nofollow" class="external text" href="http://www.washburnresearch.org/cryptography/archive/WaMM-SHA3.pdf">the original</a> <span class="cs1-format">(PDF)</span> on April 19, 2009<span class="reference-accessdate">. Retrieved <span class="nowrap">November 9,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=WaMM%3A+A+Candidate+Algorithm+for+the+SHA-3+Competition&rft.au=John+Washburn&rft_id=http%3A%2F%2Fwww.washburnresearch.org%2Fcryptography%2Farchive%2FWaMM-SHA3.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-65"><span class="mw-cite-backlink"><b><a href="#cite_ref-65">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/WaMM_Comments.pdf">"Official Comment: WaMM is Withdrawn"</a> <span class="cs1-format">(PDFauthor=John Washburn)</span>. December 20, 2008<span class="reference-accessdate">. Retrieved <span class="nowrap">December 23,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Official+Comment%3A+WaMM+is+Withdrawn&rft.date=2008-12-20&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Fsha-3%2FRound1%2Fdocuments%2FWaMM_Comments.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-66"><span class="mw-cite-backlink"><b><a href="#cite_ref-66">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBob_Hattersly2008" class="citation web cs1">Bob Hattersly (October 15, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/1/19/Waterfall_Specification_1.0.pdf">"Waterfall Hash – Algorithm Specification and Analysis"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 9,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Waterfall+Hash+%E2%80%93+Algorithm+Specification+and+Analysis&rft.date=2008-10-15&rft.au=Bob+Hattersly&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F1%2F19%2FWaterfall_Specification_1.0.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-67"><span class="mw-cite-backlink"><b><a href="#cite_ref-67">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBob_Hattersley2008" class="citation web cs1">Bob Hattersley (December 20, 2008). <a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/documents/Waterfall_Comments.pdf">"Official Comment: Waterfall is broken"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 23,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Official+Comment%3A+Waterfall+is+broken&rft.date=2008-12-20&rft.au=Bob+Hattersley&rft_id=http%3A%2F%2Fcsrc.nist.gov%2Fgroups%2FST%2Fhash%2Fsha-3%2FRound1%2Fdocuments%2FWaterfall_Comments.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-68"><span class="mw-cite-backlink"><b><a href="#cite_ref-68">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBruce_Schneier2008" class="citation web cs1">Bruce Schneier (November 19, 2008). <a rel="nofollow" class="external text" href="http://www.schneier.com/blog/archives/2008/11/skein_and_sha-3.html">"Skein and SHA-3 News"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">December 23,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Skein+and+SHA-3+News&rft.date=2008-11-19&rft.au=Bruce+Schneier&rft_id=http%3A%2F%2Fwww.schneier.com%2Fblog%2Farchives%2F2008%2F11%2Fskein_and_sha-3.html&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-69"><span class="mw-cite-backlink"><b><a href="#cite_ref-69">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFRobert_J._Jenkins_Jr." class="citation web cs1">Robert J. Jenkins Jr. <a rel="nofollow" class="external text" href="http://burtleburtle.net/bob/crypto/maraca/nist/">"Algorithm Specification"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">December 15,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Algorithm+Specification&rft.au=Robert+J.+Jenkins+Jr.&rft_id=http%3A%2F%2Fburtleburtle.net%2Fbob%2Fcrypto%2Fmaraca%2Fnist%2F&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-70"><span class="mw-cite-backlink"><b><a href="#cite_ref-70">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFAnne_CanteautMaría_Naya-Plasencia" class="citation web cs1">Anne Canteaut & María Naya-Plasencia. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/5/52/Maraca.pdf">"Internal collision attack on Maraca"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">December 15,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Internal+collision+attack+on+Maraca&rft.au=Anne+Canteaut&rft.au=Mar%C3%ADa+Naya-Plasencia&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F5%2F52%2FMaraca.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-71"><span class="mw-cite-backlink"><b><a href="#cite_ref-71">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMichael_P._Frank" class="citation web cs1">Michael P. Frank. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20160304051325/https://dl.dropboxusercontent.com/u/3133557/Bitcoin/mixit-spec.pdf">"Algorithm Specification for MIXIT: a SHA-3 Candidate Cryptographic Hash Algorithm"</a> <span class="cs1-format">(PDF)</span>. Archived from <a rel="nofollow" class="external text" href="https://dl.dropboxusercontent.com/u/3133557/Bitcoin/mixit-spec.pdf">the original</a> <span class="cs1-format">(PDF)</span> on March 4, 2016<span class="reference-accessdate">. Retrieved <span class="nowrap">January 12,</span> 2014</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Algorithm+Specification+for+MIXIT%3A+a+SHA-3+Candidate+Cryptographic+Hash+Algorithm&rft.au=Michael+P.+Frank&rft_id=https%3A%2F%2Fdl.dropboxusercontent.com%2Fu%2F3133557%2FBitcoin%2Fmixit-spec.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-72"><span class="mw-cite-backlink"><b><a href="#cite_ref-72">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFGeoffrey_Park" class="citation web cs1">Geoffrey Park. <a rel="nofollow" class="external text" href="http://geoffrey.park.googlepages.com/SHA3Submission01.pdf">"NKS 2D Cellular Automata Hash"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 9,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=NKS+2D+Cellular+Automata+Hash&rft.au=Geoffrey+Park&rft_id=http%3A%2F%2Fgeoffrey.park.googlepages.com%2FSHA3Submission01.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-73"><span class="mw-cite-backlink"><b><a href="#cite_ref-73">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFCristophe_De_Cannière2008" class="citation web cs1">Cristophe De Cannière (November 13, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/3/3f/NK2SD-224.txt">"Collisions for NKS2D-224"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">November 14,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Collisions+for+NKS2D-224&rft.date=2008-11-13&rft.au=Cristophe+De+Canni%C3%A8re&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F3%2F3f%2FNK2SD-224.txt&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-74"><span class="mw-cite-backlink"><b><a href="#cite_ref-74">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFBrandon_Enright2008" class="citation web cs1">Brandon Enright (November 14, 2008). <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/9/93/NK2SD-512.txt">"Collisions for NKS2D-512"</a><span class="reference-accessdate">. Retrieved <span class="nowrap">November 14,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Collisions+for+NKS2D-512&rft.date=2008-11-14&rft.au=Brandon+Enright&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F9%2F93%2FNK2SD-512.txt&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-75"><span class="mw-cite-backlink"><b><a href="#cite_ref-75">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFPeter_Schmidt-Nielsen" class="citation web cs1">Peter Schmidt-Nielsen. <a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/uploads/3/3c/PonicSpecification.pdf">"Ponic"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 9,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Ponic&rft.au=Peter+Schmidt-Nielsen&rft_id=http%3A%2F%2Fehash.iaik.tugraz.at%2Fuploads%2F3%2F3c%2FPonicSpecification.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-76"><span class="mw-cite-backlink"><b><a href="#cite_ref-76">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFMaría_Naya-Plasencia" class="citation web cs1">María Naya-Plasencia. <a rel="nofollow" class="external text" href="http://131002.net/data/papers/ponic.pdf">"Second preimage attack on Ponic"</a> <span class="cs1-format">(PDF)</span><span class="reference-accessdate">. Retrieved <span class="nowrap">November 30,</span> 2008</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=Second+preimage+attack+on+Ponic&rft.au=Mar%C3%ADa+Naya-Plasencia&rft_id=http%3A%2F%2F131002.net%2Fdata%2Fpapers%2Fponic.pdf&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> <li id="cite_note-77"><span class="mw-cite-backlink"><b><a href="#cite_ref-77">^</a></b></span> <span class="reference-text"><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1238218222"><cite id="CITEREFNicolas_T._CourtoisCarmi_GresselAvi_HechtGregory_V._Bard" class="citation web cs1">Nicolas T. Courtois; Carmi Gressel; Avi Hecht; Gregory V. Bard; Ran Granot. <a rel="nofollow" class="external text" href="https://web.archive.org/web/20090209040334/http://fortressgb.com/apage/39649.php">"ZK-Crypt Homepage"</a>. Archived from <a rel="nofollow" class="external text" href="http://www.fortressgb.com/apage/39649.php">the original</a> on February 9, 2009<span class="reference-accessdate">. Retrieved <span class="nowrap">March 1,</span> 2009</span>.</cite><span title="ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=unknown&rft.btitle=ZK-Crypt+Homepage&rft.au=Nicolas+T.+Courtois&rft.au=Carmi+Gressel&rft.au=Avi+Hecht&rft.au=Gregory+V.+Bard&rft.au=Ran+Granot&rft_id=http%3A%2F%2Fwww.fortressgb.com%2Fapage%2F39649.php&rfr_id=info%3Asid%2Fen.wikipedia.org%3ANIST+hash+function+competition" class="Z3988"></span></span> </li> </ol></div> <div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2><span class="mw-editsection"><span class="mw-editsection-bracket">[</span><a href="/w/index.php?title=NIST_hash_function_competition&action=edit&section=12" title="Edit section: External links"><span>edit</span></a><span class="mw-editsection-bracket">]</span></span></div> <ul><li><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/index.html">NIST website for competition</a></li> <li><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round2/submissions_rnd2.html">Official list of second round candidates</a></li> <li><a rel="nofollow" class="external text" href="http://csrc.nist.gov/groups/ST/hash/sha-3/Round1/submissions_rnd1.html">Official list of first round candidates</a></li> <li><a rel="nofollow" class="external text" href="http://ehash.iaik.tugraz.at/wiki/The_SHA-3_Zoo">SHA-3 Zoo</a></li> <li><a rel="nofollow" class="external text" href="http://eprint.iacr.org/2008/511.pdf">Classification of the SHA-3 Candidates</a></li> <li><a rel="nofollow" class="external text" href="https://web.archive.org/web/20081225051427/http://www.larc.usp.br/~pbarreto/hflounge.html">Hash Function Lounge</a></li> <li><a rel="nofollow" class="external text" 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 rel="nofollow" class="external text" href="http://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf">FIPS 202 – The SHA-3 Standard</a></li></ul> <div class="navbox-styles"><style data-mw-deduplicate="TemplateStyles:r1129693374">.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}</style><style data-mw-deduplicate="TemplateStyles:r1236075235">.mw-parser-output .navbox{box-sizing:border-box;border:1px solid #a2a9b1;width:100%;clear:both;font-size:88%;text-align:center;padding:1px;margin:1em auto 0}.mw-parser-output .navbox .navbox{margin-top:0}.mw-parser-output .navbox+.navbox,.mw-parser-output .navbox+.navbox-styles+.navbox{margin-top:-1px}.mw-parser-output .navbox-inner,.mw-parser-output .navbox-subgroup{width:100%}.mw-parser-output .navbox-group,.mw-parser-output .navbox-title,.mw-parser-output .navbox-abovebelow{padding:0.25em 1em;line-height:1.5em;text-align:center}.mw-parser-output .navbox-group{white-space:nowrap;text-align:right}.mw-parser-output .navbox,.mw-parser-output .navbox-subgroup{background-color:#fdfdfd}.mw-parser-output .navbox-list{line-height:1.5em;border-color:#fdfdfd}.mw-parser-output .navbox-list-with-group{text-align:left;border-left-width:2px;border-left-style:solid}.mw-parser-output tr+tr>.navbox-abovebelow,.mw-parser-output tr+tr>.navbox-group,.mw-parser-output tr+tr>.navbox-image,.mw-parser-output tr+tr>.navbox-list{border-top:2px solid #fdfdfd}.mw-parser-output .navbox-title{background-color:#ccf}.mw-parser-output .navbox-abovebelow,.mw-parser-output .navbox-group,.mw-parser-output .navbox-subgroup .navbox-title{background-color:#ddf}.mw-parser-output .navbox-subgroup .navbox-group,.mw-parser-output .navbox-subgroup .navbox-abovebelow{background-color:#e6e6ff}.mw-parser-output .navbox-even{background-color:#f7f7f7}.mw-parser-output .navbox-odd{background-color:transparent}.mw-parser-output .navbox .hlist td dl,.mw-parser-output .navbox .hlist td ol,.mw-parser-output .navbox .hlist td ul,.mw-parser-output .navbox td.hlist dl,.mw-parser-output .navbox td.hlist ol,.mw-parser-output .navbox td.hlist ul{padding:0.125em 0}.mw-parser-output .navbox .navbar{display:block;font-size:100%}.mw-parser-output .navbox-title .navbar{float:left;text-align:left;margin-right:0.5em}body.skin--responsive .mw-parser-output .navbox-image img{max-width:none!important}@media print{body.ns-0 .mw-parser-output .navbox{display:none!important}}</style><link rel="mw-deduplicated-inline-style" href="mw-data:TemplateStyles:r1129693374"><style data-mw-deduplicate="TemplateStyles:r1239400231">.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}</style></div><div role="navigation" class="navbox" aria-label="Navbox" style="padding:3px"><table class="nowraplinks hlist navbox-inner" style="border-spacing:0;background:transparent;color:inherit"><tbody><tr><td colspan="2" class="navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"></div><table class="nowraplinks navbox-subgroup" style="border-spacing:0"><tbody><tr><td colspan="2" class="navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"></div><table class="nowraplinks hlist mw-collapsible mw-collapsed navbox-subgroup" style="border-spacing:0"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:Cryptography_hash" title="Template:Cryptography hash"><abbr title="View this template">v</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:Cryptography_hash" title="Template talk:Cryptography hash"><abbr title="Discuss this template">t</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:EditPage/Template:Cryptography_hash" title="Special:EditPage/Template:Cryptography hash"><abbr title="Edit this template">e</abbr></a></li></ul></div><div id="Cryptographic_hash_functions_and_message_authentication_codes" style="font-size:114%;margin:0 4em"><a href="/wiki/Cryptographic_hash_function" title="Cryptographic hash function">Cryptographic hash functions</a> and <a href="/wiki/Message_authentication_code" title="Message authentication code">message authentication codes</a></div></th></tr><tr><td class="navbox-abovebelow" colspan="2"><div> <ul><li><a href="/wiki/List_of_hash_functions" title="List of hash functions">List</a></li> <li><a href="/wiki/Comparison_of_cryptographic_hash_functions" title="Comparison of cryptographic hash functions">Comparison</a></li> <li><a href="/wiki/Hash_function_security_summary" title="Hash function security summary">Known attacks</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Common functions</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/MD5" title="MD5">MD5</a> (compromised)</li> <li><a href="/wiki/SHA-1" title="SHA-1">SHA-1</a> (compromised)</li> <li><a href="/wiki/SHA-2" title="SHA-2">SHA-2</a></li> <li><a href="/wiki/SHA-3" title="SHA-3">SHA-3</a></li> <li><a href="/wiki/BLAKE_(hash_function)#BLAKE2" title="BLAKE (hash function)">BLAKE2</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a class="mw-selflink selflink">SHA-3 finalists</a></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/BLAKE_(hash_function)" title="BLAKE (hash function)">BLAKE</a></li> <li><a href="/wiki/Gr%C3%B8stl" title="Grøstl">Grøstl</a></li> <li><a href="/wiki/JH_(hash_function)" title="JH (hash function)">JH</a></li> <li><a href="/wiki/Skein_(hash_function)" title="Skein (hash function)">Skein</a></li> <li><a href="/wiki/SHA-3" title="SHA-3">Keccak</a> (winner)</li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Other functions</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/BLAKE3" class="mw-redirect" title="BLAKE3">BLAKE3</a></li> <li><a href="/wiki/CubeHash" title="CubeHash">CubeHash</a></li> <li><a href="/wiki/Elliptic_curve_only_hash" title="Elliptic curve only hash">ECOH</a></li> <li><a href="/wiki/Fast_syndrome-based_hash" title="Fast syndrome-based hash">FSB</a></li> <li><a href="/wiki/Fugue_(hash_function)" title="Fugue (hash function)">Fugue</a></li> <li><a href="/wiki/GOST_(hash_function)" title="GOST (hash function)">GOST</a></li> <li><a href="/wiki/HAS-160" title="HAS-160">HAS-160</a></li> <li><a href="/wiki/HAVAL" title="HAVAL">HAVAL</a></li> <li><a href="/wiki/Kupyna" title="Kupyna">Kupyna</a></li> <li><a href="/wiki/LSH_(hash_function)" title="LSH (hash function)">LSH</a></li> <li><a href="/wiki/Lane_(hash_function)" title="Lane (hash function)">Lane</a></li> <li><a href="/wiki/MASH-1" title="MASH-1">MASH-1</a></li> <li><a href="/wiki/MASH-1#MASH2" title="MASH-1">MASH-2</a></li> <li><a href="/wiki/MD2_(hash_function)" title="MD2 (hash function)">MD2</a></li> <li><a href="/wiki/MD4" title="MD4">MD4</a></li> <li><a href="/wiki/MD6" title="MD6">MD6</a></li> <li><a href="/wiki/MDC-2" title="MDC-2">MDC-2</a></li> <li><a href="/wiki/N-hash" title="N-hash">N-hash</a></li> <li><a href="/wiki/RIPEMD" title="RIPEMD">RIPEMD</a></li> <li><a href="/wiki/RadioGat%C3%BAn" title="RadioGatún">RadioGatún</a></li> <li><a href="/wiki/SIMD_(hash_function)" title="SIMD (hash function)">SIMD</a></li> <li><a href="/wiki/SM3_(hash_function)" title="SM3 (hash function)">SM3</a></li> <li><a href="/wiki/SWIFFT" title="SWIFFT">SWIFFT</a></li> <li><a href="/wiki/Shabal" title="Shabal">Shabal</a></li> <li><a href="/wiki/Snefru" title="Snefru">Snefru</a></li> <li><a href="/wiki/Streebog" title="Streebog">Streebog</a></li> <li><a href="/wiki/Tiger_(hash_function)" title="Tiger (hash function)">Tiger</a></li> <li><a href="/wiki/Very_smooth_hash" title="Very smooth hash">VSH</a></li> <li><a href="/wiki/Whirlpool_(hash_function)" title="Whirlpool (hash function)">Whirlpool</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Password hashing/<br /><a href="/wiki/Key_stretching" title="Key stretching">key stretching</a> functions</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Argon2" title="Argon2">Argon2</a></li> <li><a href="/wiki/Balloon_hashing" title="Balloon hashing">Balloon</a></li> <li><a href="/wiki/Bcrypt" title="Bcrypt">bcrypt</a></li> <li><a href="/wiki/Catena_(cryptography)" class="mw-redirect" title="Catena (cryptography)">Catena</a></li> <li><a href="/wiki/Crypt_(C)" title="Crypt (C)">crypt</a></li> <li><a href="/wiki/LAN_Manager#LM_hash_details" title="LAN Manager">LM hash</a></li> <li><a href="/wiki/Lyra2" title="Lyra2">Lyra2</a></li> <li><a href="/wiki/Makwa_(cryptography)" class="mw-redirect" title="Makwa (cryptography)">Makwa</a></li> <li><a href="/wiki/PBKDF2" title="PBKDF2">PBKDF2</a></li> <li><a href="/wiki/Scrypt" title="Scrypt">scrypt</a></li> <li><a href="/wiki/Yescrypt" title="Yescrypt">yescrypt</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">General purpose<br /><a href="/wiki/Key_derivation_function" title="Key derivation function">key derivation functions</a></th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/HKDF" title="HKDF">HKDF</a></li> <li>KDF1/KDF2</li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="/wiki/Message_authentication_code" title="Message authentication code">MAC functions</a></th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/CBC-MAC" title="CBC-MAC">CBC-MAC</a></li> <li><a href="/wiki/Data_Authentication_Algorithm" title="Data Authentication Algorithm">DAA</a></li> <li><a href="/wiki/Galois_Message_Authentication_Code" class="mw-redirect" title="Galois Message Authentication Code">GMAC</a></li> <li><a href="/wiki/HMAC" title="HMAC">HMAC</a></li> <li><a href="/wiki/NMAC" class="mw-redirect" title="NMAC">NMAC</a></li> <li><a href="/wiki/One-key_MAC" title="One-key MAC">OMAC</a>/<a href="/wiki/One-key_MAC" title="One-key MAC">CMAC</a></li> <li><a href="/wiki/PMAC_(cryptography)" title="PMAC (cryptography)">PMAC</a></li> <li><a href="/wiki/Poly1305" title="Poly1305">Poly1305</a></li> <li><a href="/wiki/SipHash" title="SipHash">SipHash</a></li> <li><a href="/wiki/UMAC_(cryptography)" title="UMAC (cryptography)">UMAC</a></li> <li><a href="/wiki/VMAC" title="VMAC">VMAC</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%"><a href="/wiki/Authenticated_encryption" title="Authenticated encryption">Authenticated<br />encryption</a> modes</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/CCM_mode" title="CCM mode">CCM</a></li> <li><a href="/wiki/ChaCha20-Poly1305" title="ChaCha20-Poly1305">ChaCha20-Poly1305</a></li> <li><a href="/wiki/CWC_mode" title="CWC mode">CWC</a></li> <li><a href="/wiki/EAX_mode" title="EAX mode">EAX</a></li> <li><a href="/wiki/Galois/Counter_Mode" title="Galois/Counter Mode">GCM</a></li> <li><a href="/wiki/IAPM_(mode)" title="IAPM (mode)">IAPM</a></li> <li><a href="/wiki/OCB_mode" title="OCB mode">OCB</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Attacks</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Collision_attack" title="Collision attack">Collision attack</a></li> <li><a href="/wiki/Preimage_attack" title="Preimage attack">Preimage attack</a></li> <li><a href="/wiki/Birthday_attack" title="Birthday attack">Birthday attack</a></li> <li><a href="/wiki/Brute-force_attack" title="Brute-force attack">Brute-force attack</a></li> <li><a href="/wiki/Rainbow_table" title="Rainbow table">Rainbow table</a></li> <li><a href="/wiki/Side-channel_attack" title="Side-channel attack">Side-channel attack</a></li> <li><a href="/wiki/Length_extension_attack" title="Length extension attack">Length extension attack</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Design</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Avalanche_effect" title="Avalanche effect">Avalanche effect</a></li> <li><a href="/wiki/Hash_collision" title="Hash collision">Hash collision</a></li> <li><a href="/wiki/Merkle%E2%80%93Damg%C3%A5rd_construction" title="Merkle–Damgård construction">Merkle–Damgård construction</a></li> <li><a href="/wiki/Sponge_function" title="Sponge function">Sponge function</a></li> <li><a href="/wiki/HAIFA_construction" title="HAIFA construction">HAIFA construction</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Standardization</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/CAESAR_Competition" title="CAESAR Competition">CAESAR Competition</a></li> <li><a href="/wiki/CRYPTREC" title="CRYPTREC">CRYPTREC</a></li> <li><a href="/wiki/NESSIE" title="NESSIE">NESSIE</a></li> <li><a class="mw-selflink selflink">NIST hash function competition</a></li> <li><a href="/wiki/Password_Hashing_Competition" title="Password Hashing Competition">Password Hashing Competition</a></li> <li><a href="/wiki/NSA_Suite_B_Cryptography" title="NSA Suite B Cryptography">NSA Suite B</a></li> <li><a href="/wiki/Commercial_National_Security_Algorithm_Suite" title="Commercial National Security Algorithm Suite">CNSA</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Utilization</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Post-quantum_cryptography#Hash-based_cryptography" title="Post-quantum cryptography">Hash-based cryptography</a></li> <li><a href="/wiki/Merkle_tree" title="Merkle tree">Merkle tree</a></li> <li><a href="/wiki/Message_authentication" title="Message authentication">Message authentication</a></li> <li><a href="/wiki/Proof_of_work" title="Proof of work">Proof of work</a></li> <li><a href="/wiki/Salt_(cryptography)" title="Salt (cryptography)">Salt</a></li> <li><a href="/wiki/Pepper_(cryptography)" title="Pepper (cryptography)">Pepper</a></li></ul> </div></td></tr></tbody></table><div></div></td></tr></tbody></table><div></div></td></tr><tr><td colspan="2" class="navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"></div><table class="nowraplinks mw-collapsible mw-collapsed navbox-subgroup" style="border-spacing:0"><tbody><tr><th scope="col" class="navbox-title" colspan="2"><div class="navbar plainlinks hlist navbar-mini"><ul><li class="nv-view"><a href="/wiki/Template:Cryptography_navbox" title="Template:Cryptography navbox"><abbr title="View this template">v</abbr></a></li><li class="nv-talk"><a href="/wiki/Template_talk:Cryptography_navbox" title="Template talk:Cryptography navbox"><abbr title="Discuss this template">t</abbr></a></li><li class="nv-edit"><a href="/wiki/Special:EditPage/Template:Cryptography_navbox" title="Special:EditPage/Template:Cryptography navbox"><abbr title="Edit this template">e</abbr></a></li></ul></div><div id="Cryptography" style="font-size:114%;margin:0 4em"><a href="/wiki/Cryptography" title="Cryptography">Cryptography</a></div></th></tr><tr><th scope="row" class="navbox-group" style="width:1%">General</th><td class="navbox-list-with-group navbox-list navbox-odd" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/History_of_cryptography" title="History of cryptography">History of cryptography</a></li> <li><a href="/wiki/Outline_of_cryptography" title="Outline of cryptography">Outline of cryptography</a></li> <li><a href="/wiki/Classical_cipher" title="Classical cipher">Classical cipher</a></li> <li><a href="/wiki/Cryptographic_protocol" title="Cryptographic protocol">Cryptographic protocol</a> <ul><li><a href="/wiki/Authentication_protocol" title="Authentication protocol">Authentication protocol</a></li></ul></li> <li><a href="/wiki/Cryptographic_primitive" title="Cryptographic primitive">Cryptographic primitive</a></li> <li><a href="/wiki/Cryptanalysis" title="Cryptanalysis">Cryptanalysis</a></li> <li><a href="/wiki/Cryptocurrency" title="Cryptocurrency">Cryptocurrency</a></li> <li><a href="/wiki/Cryptosystem" title="Cryptosystem">Cryptosystem</a></li> <li><a href="/wiki/Cryptographic_nonce" title="Cryptographic nonce">Cryptographic nonce</a></li> <li><a href="/wiki/Cryptovirology" title="Cryptovirology">Cryptovirology</a></li> <li><a href="/wiki/Hash_function" title="Hash function">Hash function</a> <ul><li><a href="/wiki/Cryptographic_hash_function" title="Cryptographic hash function">Cryptographic hash function</a></li> <li><a href="/wiki/Key_derivation_function" title="Key derivation function">Key derivation function</a></li> <li><a href="/wiki/Secure_Hash_Algorithms" title="Secure Hash Algorithms">Secure Hash Algorithms</a></li></ul></li> <li><a href="/wiki/Digital_signature" title="Digital signature">Digital signature</a></li> <li><a href="/wiki/Kleptography" title="Kleptography">Kleptography</a></li> <li><a href="/wiki/Key_(cryptography)" title="Key (cryptography)">Key (cryptography)</a></li> <li><a href="/wiki/Key_exchange" title="Key exchange">Key exchange</a></li> <li><a href="/wiki/Key_generator" title="Key generator">Key generator</a></li> <li><a href="/wiki/Key_schedule" title="Key schedule">Key schedule</a></li> <li><a href="/wiki/Key_stretching" title="Key stretching">Key stretching</a></li> <li><a href="/wiki/Keygen" title="Keygen">Keygen</a></li> <li><a href="/wiki/Template:Cryptography_machines" title="Template:Cryptography machines">Machines</a></li> <li><a href="/wiki/Cryptojacking_malware" class="mw-redirect" title="Cryptojacking malware">Cryptojacking malware</a></li> <li><a href="/wiki/Ransomware" title="Ransomware">Ransomware</a></li> <li><a href="/wiki/Random_number_generation" title="Random number generation">Random number generation</a> <ul><li><a href="/wiki/Cryptographically_secure_pseudorandom_number_generator" title="Cryptographically secure pseudorandom number generator">Cryptographically secure pseudorandom number generator</a> (CSPRNG)</li></ul></li> <li><a href="/wiki/Pseudorandom_noise" title="Pseudorandom noise">Pseudorandom noise</a> (PRN)</li> <li><a href="/wiki/Secure_channel" title="Secure channel">Secure channel</a></li> <li><a href="/wiki/Insecure_channel" class="mw-redirect" title="Insecure channel">Insecure channel</a></li> <li><a href="/wiki/Subliminal_channel" title="Subliminal channel">Subliminal channel</a></li> <li><a href="/wiki/Encryption" title="Encryption">Encryption</a></li> <li><a href="/wiki/Decryption" class="mw-redirect" title="Decryption">Decryption</a></li> <li><a href="/wiki/End-to-end_encryption" title="End-to-end encryption">End-to-end encryption</a></li> <li><a href="/wiki/Harvest_now,_decrypt_later" title="Harvest now, decrypt later">Harvest now, decrypt later</a></li> <li><a href="/wiki/Information-theoretic_security" title="Information-theoretic security">Information-theoretic security</a></li> <li><a href="/wiki/Plaintext" title="Plaintext">Plaintext</a></li> <li><a href="/wiki/Codetext" class="mw-redirect" title="Codetext">Codetext</a></li> <li><a href="/wiki/Ciphertext" title="Ciphertext">Ciphertext</a></li> <li><a href="/wiki/Shared_secret" title="Shared secret">Shared secret</a></li> <li><a href="/wiki/Trapdoor_function" title="Trapdoor function">Trapdoor function</a></li> <li><a href="/wiki/Trusted_timestamping" title="Trusted timestamping">Trusted timestamping</a></li> <li><a href="/wiki/Key-based_routing" title="Key-based routing">Key-based routing</a></li> <li><a href="/wiki/Onion_routing" title="Onion routing">Onion routing</a></li> <li><a href="/wiki/Garlic_routing" title="Garlic routing">Garlic routing</a></li> <li><a href="/wiki/Kademlia" title="Kademlia">Kademlia</a></li> <li><a href="/wiki/Mix_network" title="Mix network">Mix network</a></li></ul> </div></td></tr><tr><th scope="row" class="navbox-group" style="width:1%">Mathematics</th><td class="navbox-list-with-group navbox-list navbox-even" style="width:100%;padding:0"><div style="padding:0 0.25em"> <ul><li><a href="/wiki/Cryptographic_hash_function" title="Cryptographic hash function">Cryptographic hash function</a></li> <li><a href="/wiki/Block_cipher" title="Block cipher">Block cipher</a></li> <li><a href="/wiki/Stream_cipher" title="Stream cipher">Stream cipher</a></li> <li><a href="/wiki/Symmetric-key_algorithm" title="Symmetric-key algorithm">Symmetric-key algorithm</a></li> <li><a href="/wiki/Authenticated_encryption" title="Authenticated encryption">Authenticated encryption</a></li> <li><a href="/wiki/Public-key_cryptography" title="Public-key cryptography">Public-key cryptography</a></li> <li><a href="/wiki/Quantum_key_distribution" title="Quantum key distribution">Quantum key distribution</a></li> <li><a href="/wiki/Quantum_cryptography" title="Quantum cryptography">Quantum cryptography</a></li> <li><a href="/wiki/Post-quantum_cryptography" title="Post-quantum cryptography">Post-quantum cryptography</a></li> <li><a href="/wiki/Message_authentication_code" title="Message authentication code">Message authentication code</a></li> <li><a href="/wiki/Cryptographically_secure_pseudorandom_number_generator" title="Cryptographically secure pseudorandom number generator">Random numbers</a></li> <li><a href="/wiki/Steganography" title="Steganography">Steganography</a></li></ul> </div></td></tr><tr><td class="navbox-abovebelow" colspan="2"><div> <ul><li><span class="noviewer" typeof="mw:File"><span title="Category"><img alt="" src="//upload.wikimedia.org/wikipedia/en/thumb/9/96/Symbol_category_class.svg/16px-Symbol_category_class.svg.png" decoding="async" width="16" height="16" class="mw-file-element" srcset="//upload.wikimedia.org/wikipedia/en/thumb/9/96/Symbol_category_class.svg/23px-Symbol_category_class.svg.png 1.5x, //upload.wikimedia.org/wikipedia/en/thumb/9/96/Symbol_category_class.svg/31px-Symbol_category_class.svg.png 2x" data-file-width="180" data-file-height="185" /></span></span> <a href="/wiki/Category:Cryptography" title="Category:Cryptography">Category</a></li></ul> </div></td></tr></tbody></table><div></div></td></tr></tbody></table></div>    </div><noscript><img src="https://login.wikimedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" width="1" height="1" style="border: none; position: absolute;"></noscript> <div class="printfooter" data-nosnippet="">Retrieved from "<a dir="ltr" href="https://en.wikipedia.org/w/index.php?title=NIST_hash_function_competition&oldid=1210884072">https://en.wikipedia.org/w/index.php?title=NIST_hash_function_competition&oldid=1210884072</a>"</div></div> <div id="catlinks" class="catlinks" data-mw="interface"><div id="mw-normal-catlinks" class="mw-normal-catlinks"><a href="/wiki/Help:Category" title="Help:Category">Categories</a>: <ul><li><a href="/wiki/Category:NIST_hash_function_competition" title="Category:NIST hash function competition">NIST hash function competition</a></li><li><a href="/wiki/Category:Cryptographic_hash_functions" title="Category:Cryptographic hash functions">Cryptographic hash functions</a></li><li><a href="/wiki/Category:Cryptography_contests" title="Category:Cryptography contests">Cryptography contests</a></li><li><a href="/wiki/Category:National_Institute_of_Standards_and_Technology" title="Category:National Institute of Standards and Technology">National Institute of Standards and Technology</a></li></ul></div><div id="mw-hidden-catlinks" class="mw-hidden-catlinks mw-hidden-cats-hidden">Hidden categories: <ul><li><a href="/wiki/Category:Webarchive_template_wayback_links" title="Category:Webarchive template wayback links">Webarchive template wayback links</a></li><li><a href="/wiki/Category:All_articles_with_dead_external_links" title="Category:All articles with dead external links">All articles with dead external links</a></li><li><a href="/wiki/Category:Articles_with_dead_external_links_from_February_2018" title="Category:Articles with dead external links from February 2018">Articles with dead external links from February 2018</a></li><li><a href="/wiki/Category:Articles_with_permanently_dead_external_links" title="Category:Articles with permanently dead external links">Articles with permanently dead external links</a></li><li><a href="/wiki/Category:Use_American_English_from_March_2019" title="Category:Use American English from March 2019">Use American English from March 2019</a></li><li><a href="/wiki/Category:All_Wikipedia_articles_written_in_American_English" title="Category:All Wikipedia articles written in American English">All Wikipedia articles written in American English</a></li><li><a href="/wiki/Category:Articles_with_short_description" title="Category:Articles with short description">Articles with short description</a></li><li><a href="/wiki/Category:Short_description_matches_Wikidata" title="Category:Short description matches Wikidata">Short description matches Wikidata</a></li><li><a href="/wiki/Category:Use_mdy_dates_from_March_2019" title="Category:Use mdy dates from March 2019">Use mdy dates from March 2019</a></li><li><a href="/wiki/Category:All_articles_with_unsourced_statements" title="Category:All articles with unsourced statements">All articles with unsourced statements</a></li><li><a href="/wiki/Category:Articles_with_unsourced_statements_from_May_2018" title="Category:Articles with unsourced statements from May 2018">Articles with unsourced statements from May 2018</a></li></ul></div></div> </div> </main> </div> <div class="mw-footer-container"> <footer id="footer" class="mw-footer" > <ul id="footer-info"> <li id="footer-info-lastmod"> This page was last edited on 28 February 2024, at 20:34<span class="anonymous-show"> (UTC)</span>.</li> <li id="footer-info-copyright">Text is available under the <a href="/wiki/Wikipedia:Text_of_the_Creative_Commons_Attribution-ShareAlike_4.0_International_License" title="Wikipedia:Text of the Creative Commons Attribution-ShareAlike 4.0 International License">Creative Commons Attribution-ShareAlike 4.0 License</a>; additional terms may apply. By using this site, you agree to the <a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Terms_of_Use" class="extiw" title="foundation:Special:MyLanguage/Policy:Terms of Use">Terms of Use</a> and <a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy" class="extiw" title="foundation:Special:MyLanguage/Policy:Privacy policy">Privacy Policy</a>. Wikipedia® is a registered trademark of the <a rel="nofollow" class="external text" href="https://wikimediafoundation.org/">Wikimedia Foundation, Inc.</a>, a non-profit organization.</li> </ul> <ul id="footer-places"> <li id="footer-places-privacy"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Privacy_policy">Privacy policy</a></li> <li id="footer-places-about"><a href="/wiki/Wikipedia:About">About Wikipedia</a></li> <li id="footer-places-disclaimers"><a href="/wiki/Wikipedia:General_disclaimer">Disclaimers</a></li> <li id="footer-places-contact"><a href="//en.wikipedia.org/wiki/Wikipedia:Contact_us">Contact Wikipedia</a></li> <li id="footer-places-wm-codeofconduct"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Universal_Code_of_Conduct">Code of Conduct</a></li> <li id="footer-places-developers"><a href="https://developer.wikimedia.org">Developers</a></li> <li id="footer-places-statslink"><a href="https://stats.wikimedia.org/#/en.wikipedia.org">Statistics</a></li> <li id="footer-places-cookiestatement"><a href="https://foundation.wikimedia.org/wiki/Special:MyLanguage/Policy:Cookie_statement">Cookie statement</a></li> <li id="footer-places-mobileview"><a href="//en.m.wikipedia.org/w/index.php?title=NIST_hash_function_competition&mobileaction=toggle_view_mobile" class="noprint stopMobileRedirectToggle">Mobile view</a></li> </ul> <ul id="footer-icons" class="noprint"> <li id="footer-copyrightico"><a href="https://wikimediafoundation.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/static/images/footer/wikimedia-button.svg" width="84" height="29" alt="Wikimedia Foundation" loading="lazy"></a></li> <li id="footer-poweredbyico"><a href="https://www.mediawiki.org/" class="cdx-button cdx-button--fake-button cdx-button--size-large cdx-button--fake-button--enabled"><img src="/w/resources/assets/poweredby_mediawiki.svg" alt="Powered by MediaWiki" width="88" height="31" loading="lazy"></a></li> </ul> </footer> </div> </div> </div> <div class="vector-settings" id="p-dock-bottom"> <ul></ul> </div><script>(RLQ=window.RLQ||[]).push(function(){mw.config.set({"wgHostname":"mw-web.codfw.main-6df7948d6c-4s4kw","wgBackendResponseTime":593,"wgPageParseReport":{"limitreport":{"cputime":"0.855","walltime":"0.978","ppvisitednodes":{"value":4711,"limit":1000000},"postexpandincludesize":{"value":205248,"limit":2097152},"templateargumentsize":{"value":3984,"limit":2097152},"expansiondepth":{"value":17,"limit":100},"expensivefunctioncount":{"value":5,"limit":500},"unstrip-depth":{"value":1,"limit":20},"unstrip-size":{"value":258834,"limit":5000000},"entityaccesscount":{"value":0,"limit":400},"timingprofile":["100.00% 860.958 1 -total"," 62.27% 536.089 1 Template:Reflist"," 51.61% 444.345 71 Template:Cite_web"," 27.10% 233.343 4 Template:Navbox"," 12.89% 110.941 1 Template:Cryptography_navbox"," 8.03% 69.157 1 Template:Short_description"," 6.62% 57.031 1 Template:Cryptography_hash"," 5.18% 44.625 3 Template:Fix"," 4.12% 35.452 1 Template:Citation_needed"," 4.06% 34.986 2 Template:Pagetype"]},"scribunto":{"limitreport-timeusage":{"value":"0.541","limit":"10.000"},"limitreport-memusage":{"value":6269856,"limit":52428800}},"cachereport":{"origin":"mw-web.eqiad.main-5dc468848-bhcc2","timestamp":"20241122143755","ttl":2592000,"transientcontent":false}}});});</script> <script type="application/ld+json">{"@context":"https:\/\/schema.org","@type":"Article","name":"NIST hash function competition","url":"https:\/\/en.wikipedia.org\/wiki\/NIST_hash_function_competition","sameAs":"http:\/\/www.wikidata.org\/entity\/Q15229223","mainEntity":"http:\/\/www.wikidata.org\/entity\/Q15229223","author":{"@type":"Organization","name":"Contributors to Wikimedia projects"},"publisher":{"@type":"Organization","name":"Wikimedia Foundation, Inc.","logo":{"@type":"ImageObject","url":"https:\/\/www.wikimedia.org\/static\/images\/wmf-hor-googpub.png"}},"datePublished":"2008-11-03T09:03:45Z","dateModified":"2024-02-28T20:34:16Z","headline":"competition to develop SHA-3"}</script> </body> </html>