SHA-3: a Secure Hash Algorithm
The MD5 cryptographic hash function was published in April 1992:
This document describes the MD5 message-digest algorithm. The algorithm takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input. It is conjectured that it is computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest. The MD5 algorithm is intended for digital signature applications, where a large file must be "compressed" in a secure manner before being encrypted with a private (secret) key under a public-key cryptosystem such as RSA.
MD5 became very widely used and inspired a number of similar-looking hash functions, including SHA-0 (1993), SHA-1 (1995), and SHA-2 (2001). SHA-2 is actually four functions: SHA-224, SHA-256, SHA-384, and SHA-512.
On 12 August 2004, Joux, Carribault, Lemuet, and Jalby announced collisions in SHA-0. On 17 August 2004, Xiaoyun Wang independently presented collisions in MD5 and faster collisions in SHA-0. In February 2005, Wang, Yiqun Lisa Yin, and Hongbo Yu announced an attack that could find collisions in SHA-1 using only 2^69 simple operations.
The goal of the SHA-3 competition was to specify "a new hash algorithm to augment and revise" FIPS 180-2, the standard that specified SHA-1 and SHA-2. The SHA-3 competition was organized by the United States National Institute of Standards and Technology (NIST).
This list includes the 51 submissions accepted for round 1, and 5 of the 13 submissions not accepted for round 1; the other 8 submissions have not been disclosed.
Version: This is version 2014.01.27 of the sha3.html web page.