2012•Unpublished venueOpen access

Third-Round Report of the SHA-3 Cryptographic Hash Algorithm Competition

Shu-jen Chang, Ray A. Perlner, William E. Burr, Meltem Sönmez Turan, John M. Kelsey, Souradyuti Paul, Lawrence E Bassham

Open full text 113 citations

Abstract

The National Institute of Standards and Technology (NIST) opened a public competition on November 2, 2007, to develop a new cryptographic hash algorithm -SHA-3, which will augment the hash algorithms specified in the Federal Information Processing Standard (FIPS) 180-4, Secure Hash Standard (SHS).The competition was NIST's response to advances in the cryptanalysis of hash algorithms.NIST received sixty-four submissions in October 2008, and selected fifty-one first-round candidates on December 10, 2008; fourteen second-round candidates on July 24, 2009; and five third-round candidates -BLAKE, Grøstl, JH, Keccak and Skein, on December 9, 2010, to advance to the final round of the competition.Eighteen months were provided for the public review of the finalists, and on October 2, 2012, NIST announced the winning algorithm of the SHA-3 competition -Keccak.This report summarizes the evaluation of the five finalists and the selection of the SHA-3 winner.

Open-access reader

About this research paper

What this paper is about

The National Institute of Standards and Technology (NIST) opened a public competition on November 2, 2007, to develop a new cryptographic hash algorithm -SHA-3, which will augment the hash algorithms specified in the Federal Information Processing Standard (FIPS) 180-4, Secure Hash Standard (SHS).The competition was NIST's response to advances in the cryptanalysis of hash algorithms.NIST received sixty-four submissions in October 2008, and selected fifty-one first-round candidates on December 10, 2008; fourteen second-round candidates on July 24, 2009; and five third-round candidates -BLAKE, Grøstl, JH, Keccak and Skein, on December 9, 2010, to advance to the final round of the competition.Eighteen months were provided for the public review of the finalists, and on October 2, 2012, NIST announced the winning algorithm of the SHA-3 competition -Keccak.This report summarizes the evaluation of the five finalists and the selection of the SHA-3 winner.

Why it matters

OpenAlex reports 113 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The National Institute of Standards and Technology (NIST) opened a public competition on November 2, 2007, to develop a new cryptographic hash algorithm -SHA-3, which will augment the hash algorithms specified in the Federal Information Processing Standard (FIPS) 180-4, Secure Hash Standard (SHS).The competition was NIST's response to advances in the cryptanalysis of hash algorithms.NIST received sixty-four submissions in October 2008, and selected fifty-one first-round candidates on December 10, 2008; fourteen second-round candidates on July 24, 2009; and five third-round candidates -BLAKE, Grøstl, JH, Keccak and Skein, on December 9, 2010, to advance to the final round of the competition.Eighteen months were provided for the public review of the finalists, and on October 2, 2012, NIST announced the winning algorithm of the SHA-3 competition -Keccak.This report summarizes the evaluation of the five finalists and the selection of the SHA-3 winner.

Key concepts: Hash function, Cryptographic hash function, Security of cryptographic hash functions, Secure Hash Algorithm, Computer science, Cryptography, SHA-2, Cryptographic protocol

Related papers

Back to paper searchBrowse research topicsOriginal source
Third-Round Report of the SHA-3 Cryptographic Hash Algorithm Competition — Research Paper | ScholarLens