Comparison of cryptographic hash functions

The following tables compare general and technical information for a number of cryptographic hash functions.^[1] An overview of hash function security/cryptanalysis can be found at hash function security summary.

General information

Basic general information about the cryptographic hash functions: year, designer, references, etc.

Notes

1. ↑ It refers to the first official description of the algorithm, not designed date.

Parameters

Notes

1. ↑ The internal state here means the "internal hash sum" after each compression of a data block. Most hash algorithms also internally use some additional variables such as length of the data compressed so far since that is needed for the length padding in the end. See the Merkle-Damgård construction for details.
2. ↑ Although the underlying algorithm Keccak has arbitrary hash lengths, the NIST specified 224, 256, 384 and 512 bits output as valid modes for SHA-3.

Compression function

The following tables compare technical information for compression functions of cryptographic hash functions. The information comes from the specifications, please refer to them for more details.

Notes

1. ↑ The omitted multiplicands are word sizes.
2. ↑ Some authors interchange passes and rounds.
3. ↑ A: addition, subtraction; B: bitwise operation; L: lookup table; S: shift, rotation.
4. ↑ It refers to byte endianness only. If the operations consist of bitwise operations and lookup tables only, the endianness is irrelevant.
5. ↑ The size of message digest equals to the size of chaining values usually. In truncated versions of certain cryptographic hash functions such as SHA-384, the former is less than the latter.
6. ↑ The size of chaining values equals to the size of computation values usually. In certain cryptographic hash functions such as RIPEMD-160, the former is less than the latter because RIPEMD-160 use two sets of parallel computaion values and then combine into a single set of chaining values.
7. ↑ The maximum input size = 2^{length size} − 1 bits. For example, the maximum input size of SHA-1 = 2⁶⁴ − 1 bits.

See also

• List of hash functions
• Hash function security summary
• Word (computer architecture)

References

External links

1. The Hash Function Lounge - A list of hash functions and known attacks, by Paulo Barreto
2. The eHash Main Page - A wiki for cryptographic hash functions
3. The NIST Hash Competition Main Page - The competition to become SHA-3

Hash functions & message authentication codes Security summary Common functions MD5 SHA-1 SHA-2 SHA-3/Keccak SHA-3 finalists BLAKE Grøstl JH Skein Keccak (winner) Other functions FSB ECOH GOST HAS-160 HAVAL Kupyna LM hash MDC-2 MD2 MD4 MD5 MD6 N-Hash RadioGatún RIPEMD SipHash Snefru Streebog SWIFFT Tiger VSH WHIRLPOOL MAC algorithms DAA CBC-MAC HMAC OMAC/CMAC PMAC VMAC UMAC Poly1305 Authenticated encryption modes CCM CWC EAX GCM IAPM OCB Attacks Collision attack Preimage attack Birthday attack Brute force attack Rainbow table Side-channel attack Length extension attack Design Avalanche effect Hash collision Merkle–Damgård construction Standardization CRYPTREC NESSIE NIST hash function competition Utilization Salt Key stretching Message authentication Key derivation functions bcrypt crypt(3) (DES) PBKDF2 scrypt Argon2 Cryptography History of cryptography Cryptanalysis Outline of cryptography Symmetric-key algorithm Block cipher Stream cipher Public-key cryptography Cryptographic hash function Message authentication code Random numbers Steganography Portal