Hash Types

Definition on the different hash types

You are here: Tools | Hash Calculator | Hash Types

The Hash Calculator uses the following hash types for its computation of different message digest. These types of hashes are just a summary of the different types of hashes the Hash Calculator can do.

Hash Types:

Adler32

invented by Mark Adler
more reliable than Fletcher-16, and slightly less reliable than Fletcher-32
can be forged easily and is therefore unsafe for protecting against intentional modification

Crc

also known as cyclic redundancy check (CRC) or polynomial code checksum
non-secure hash function designed to detect accidental changes to raw computer data
not suitable for protecting against intentional alteration of data

Gost

based on Soviet and Russian government standard symmetric key block cipher, GOST block cipher
alternative to the United States standard algorithm, DES
compared to DES, GOST has a very simple round function. However, the designers of GOST attempted to offset the simplicity of the round function by specifying the algorithm with 32 rounds and secret S-boxes

Haval

invented by Yuliang Zheng, Josef Pieprzyk, and Jennifer Seberry in 1992
unlike MD5, it can produce hashes in lengths of 128 bits, 160 bits, 192 bits, 224 bits, and 256 bits
research has uncovered weaknesses which make further use of HAVAL (at least the variant with 128 bits and 3 passes) questionable. On 17 August 2004, collisions for HAVAL (128 bits, 3 passes) were announced by Xiaoyun Wang, Dengguo Feng, Xuejia Lai, and Hongbo Yu

Md2

developed by Ronald Rivest in 1989
also known as Message Digest Algorithm 2
remains in use in public key infrastructures as part of certificates generated with MD2 and RSA
vulnerable to a preimage attack with time complexity

Md4

designed by Professor Ronald Rivest of MIT in 1990
also known as Message-Digest algorithm 4 which is a message digest algorithm (the fourth in a series)
weaknesses in MD4 were demonstrated by Den Boer and Bosselaers in a paper published in 1991

Md5

designed by Ron Rivest in 1991 to replace an earlier hash function, MD4
also known as Message-Digest algorithm 5
Recently, a number of projects have created MD5 rainbow tables which are easily accessible online, and can be used to reverse many MD5 hashes into strings that collide with the original input, usually for the purposes of password cracking

Ripemd

developed in Leuven (Belgium) by Hans Dobbertin, Antoon Bosselaers and Bart Preneel at the COSIC research group at the Katholieke Universiteit Leuven, and first published in 1996
also known as RACE Integrity Primitives Evaluation Message Digest
there also exist 128, 256 and 320-bit versions of this algorithm, called RIPEMD-128, RIPEMD-256, and RIPEMD-320, respectively
the 128-bit version was intended only as a drop-in replacement for the original RIPEMD, which was also 128-bit, and which had been found to have questionable security. The 256 and 320-bit versions diminish only the chance of accidental collision, and don't have higher levels of security as compared to, respectively, RIPEMD-128 and RIPEMD-160

Sha

designed by the National Security Agency (NSA) and published by the NIST as a U.S. Federal Information Processing Standard
also known as Secure Hash Algorithm
the three SHA algorithms are structured differently and are distinguished as SHA-0, SHA-1, and SHA-2. The SHA-2 family uses an identical algorithm with a variable digest size which is distinguished as SHA-224, SHA-256, SHA-384, and SHA-512
security flaws were identified in SHA-1
no attacks have yet been reported on the SHA-2 variants, they are algorithmically similar to SHA-1 and so efforts are underway to develop improved alternatives

Snefru

invented by Ralph Merkle
named after the Egyptian Pharaoh Sneferu, continuing the tradition of the Khufu and Khafre block ciphers
the original design of Snefru was shown to be insecure by Eli Biham and Adi Shamir who were able to use differential cryptanalysis to find hash collisions

Tiger

designed by Ross Anderson and Eli Biham in 1995
the size of a Tiger hash value is 192 bits
unlike MD5 or SHA-0/1, there are no known attacks on the full 24-round Tiger except for pseudo-near collision

Whirlpool

designed by Vincent Rijmen (co-creator of the Advanced Encryption Standard) and Paulo S. L. M. Barreto first described in 2000
recommended by the NESSIE project
adopted by the International Organization for Standardization (ISO) and the International Electrotechnical Commission (IEC) as part of the joint ISO/IEC 10118-3 international standard