Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

New Cryptographic Hash Algorithm Family: NIST Holds a Public Competition to Find New Algorithms



Shirley M. Radack


This bulletin summarizes the information that was disseminated by the National Institute of Standards and Technology (NIST) in a November 2007 Federal Register Notice. NIST is soliciting candidates for a new and robust cryptographic hash algorithm for use by Federal government agencies in protecting their information systems and information. The notice invited the public to submit candidate algorithms, and all nominations must be received by NIST by October 31, 2008. NIST is conducting an open, public process to identify suitable candidates for the new hash algorithm, which is needed because of recent advances in the cryptanalysis of hash functions. The new hash algorithm will be named SHA-3, and it will augment the hash algorithms currently specified in Federal Information Processing Standard (FIPS) 180-2, Secure Hash Standard. Hash algorithms take a variable length message and produce a small fixed size output called a hash value or message digest. Hash algorithms are used as building blocks in many cryptographic applications such as digital signatures, message authentication code, key derivation, and random number generators.
ITL Bulletin -


Cryptography, digital signatures, Federal Information Processing Standards, hash algorithms, information security, message authentication, Secure Hash Standard.


Radack, S. (2008), New Cryptographic Hash Algorithm Family: NIST Holds a Public Competition to Find New Algorithms, ITL Bulletin, National Institute of Standards and Technology, Gaithersburg, MD, [online], (Accessed July 14, 2024)


If you have any questions about this publication or are having problems accessing it, please contact

Created May 28, 2008, Updated February 19, 2017