Difference between revisions of "The Hash Function Zoo"
From The ECRYPT Hash Function Website
Crechberger (talk | contribs) |
|||
Line 23: | Line 23: | ||
| [http://ehash.iaik.tugraz.at/index.php/FFT-Hash-II FFT-Hash II] || Schnorr || align="center"|1992 || broken | | [http://ehash.iaik.tugraz.at/index.php/FFT-Hash-II FFT-Hash II] || Schnorr || align="center"|1992 || broken | ||
|- | |- | ||
− | | [http://ehash.iaik.tugraz.at/index.php/FORK256 FORK-256] || Hong, Chang, Sung, Lee, Hong, Lee, Moon, Chee || align="center"|2006 || | + | | [http://ehash.iaik.tugraz.at/index.php/FORK256 FORK-256] || Hong, Chang, Sung, Lee, Hong, Lee, Moon, Chee || align="center"|2006 || broken |
|- | |- | ||
| [http://ehash.iaik.tugraz.at/index.php/FSB FSB] || Augot, Finiasz, Sendrier || align="center"|2005 || ? | | [http://ehash.iaik.tugraz.at/index.php/FSB FSB] || Augot, Finiasz, Sendrier || align="center"|2005 || ? | ||
Line 41: | Line 41: | ||
| [http://ehash.iaik.tugraz.at/index.php/LAKE LAKE] || Aumasson, Meier, Phan|| align="center"|2008|| ? | | [http://ehash.iaik.tugraz.at/index.php/LAKE LAKE] || Aumasson, Meier, Phan|| align="center"|2008|| ? | ||
|- | |- | ||
− | | [http://ehash.iaik.tugraz.at/index.php/LASH-n LASH-n] || Bentahar, Page, Saarinen, Silverman, Smart || align="center"|2006 || | + | | [http://ehash.iaik.tugraz.at/index.php/LASH-n LASH-n] || Bentahar, Page, Saarinen, Silverman, Smart || align="center"|2006 || broken |
|- | |- | ||
| [http://ehash.iaik.tugraz.at/index.php/MAME MAME] || Yoshida, Watanabe, Okeya, Kitahara, Wu, Kucuk, Preneel || align="center"|2007 || ? | | [http://ehash.iaik.tugraz.at/index.php/MAME MAME] || Yoshida, Watanabe, Okeya, Kitahara, Wu, Kucuk, Preneel || align="center"|2007 || ? | ||
Line 73: | Line 73: | ||
| [http://ehash.iaik.tugraz.at/index.php/SHA-0 SHA-0] || NIST/NSA || align="center"|1991 || broken | | [http://ehash.iaik.tugraz.at/index.php/SHA-0 SHA-0] || NIST/NSA || align="center"|1991 || broken | ||
|- | |- | ||
− | | [http://ehash.iaik.tugraz.at/index.php/SHA-1 SHA-1] || NIST/NSA || align="center"|1993 || | + | | [http://ehash.iaik.tugraz.at/index.php/SHA-1 SHA-1] || NIST/NSA || align="center"|1993 || broken |
|- | |- | ||
| [http://ehash.iaik.tugraz.at/index.php/SHA-256 SHA-256/224] || NIST/NSA || align="center"|2000 || ? | | [http://ehash.iaik.tugraz.at/index.php/SHA-256 SHA-256/224] || NIST/NSA || align="center"|2000 || ? | ||
Line 83: | Line 83: | ||
| [http://ehash.iaik.tugraz.at/index.php/Snefru-n Snefru-n] || Merkle || align="center"|1990 || broken | | [http://ehash.iaik.tugraz.at/index.php/Snefru-n Snefru-n] || Merkle || align="center"|1990 || broken | ||
|- | |- | ||
− | | [http://ehash.iaik.tugraz.at/index.php/StepRightUp StepRightUp] || Daemen || align="center"|1995 || | + | | [http://ehash.iaik.tugraz.at/index.php/StepRightUp StepRightUp] || Daemen || align="center"|1995 || broken |
|- | |- | ||
| [http://ehash.iaik.tugraz.at/index.php/SubHash SubHash] || Daemen || align="center"|1992 || ? | | [http://ehash.iaik.tugraz.at/index.php/SubHash SubHash] || Daemen || align="center"|1992 || ? | ||
Line 94: | Line 94: | ||
|} | |} | ||
− | Note that the source for most of the data collected here (proposals and analysis results) is published in one of the following venues. Journal of Cryptology, IEEE Transactions on | + | Regarding the column cryptanalysis status, for simplicity reasons we take the following view. |
+ | As soon as there are results suggesting that an expected property of a hash function is less than ideal, we list it as 'broken'. Resulting attacks may be by no means practical. | ||
+ | |||
+ | Note that the source for most of the data collected here (proposals and analysis results) is published in one of the following venues. Journal of Cryptology, IEEE Transactions on Information Theory, proceedings of IACR conferences like Crypto, Eurocrypt, Asiacrypt, FSE. Additionally also SAC, ISC, CT-RSA, PKCS, FIPS and ISO Standards are used. |
Revision as of 23:08, 1 November 2008
Hash Function Name | Designer(s) | Issued in | Status Cryptanalysis |
---|---|---|---|
AR | ISO | 1992 | broken |
Boognish | Daemen | 1992 | broken |
Cellhash | Daemen, Govaerts, Vandewalle | 1991 | ? |
DHA-256 | Lee, Chang, Kim, Lee, Hong | 2006 | ? |
Edon-R | Gligoroski, Markovski, Kocarev | 2006 | ? |
FFT-Hash I | Schnorr | 1991 | broken |
FFT-Hash II | Schnorr | 1992 | broken |
FORK-256 | Hong, Chang, Sung, Lee, Hong, Lee, Moon, Chee | 2006 | broken |
FSB | Augot, Finiasz, Sendrier | 2005 | ? |
GOST R 34.11-94 | Government Committee of Russia for Standards | 1990 | broken |
Grindahl-256 | Knudsen, Rechberger, Thomsen | 2007 | broken |
Grindahl-512 | Knudsen, Rechberger, Thomsen | 2007 | ? |
HAS-160 | Telecommunications Technology Association of Korea | 2000 | ? |
HAS-V | Park, Hwang, Lee | 2000 | broken |
HAVAL | Zheng, Pieprzyk, Seberry | 1994 | broken |
LAKE | Aumasson, Meier, Phan | 2008 | ? |
LASH-n | Bentahar, Page, Saarinen, Silverman, Smart | 2006 | broken |
MAME | Yoshida, Watanabe, Okeya, Kitahara, Wu, Kucuk, Preneel | 2007 | ? |
MD2 | Rivest | 1989 | broken |
MD4 | Rivest | 1990 | broken |
MD5 | Rivest | 1992 | broken |
N-Hash | Miyaguchi, Ohta, Iwata | 1990 | broken |
PANAMA | Daemen, Clapp | 1998 | broken |
Parallel FFT-Hash | Schnorr, Vaudenay | 1993 | ? |
PARSHA-256 | Pal, Sarkar | 2003 | ? |
PKC-HASH | Shin, Rhee, Ryu, Lee | 1998 | broken |
RadioGatun | Bertoni, Daemen, Peeters, van Assche | 2006 | ? |
RC4-HASH | Chang, Gupta, Nandi | 2006 | broken |
RIPEMD | The RIPE Consortium | 1990 | broken |
RIPEMD-128 | Dobbertin, Bosselaers, Preneel | 1996 | ? |
RIPEMD-160 | Dobbertin, Bosselaers, Preneel | 1996 | ? |
SHA-0 | NIST/NSA | 1991 | broken |
SHA-1 | NIST/NSA | 1993 | broken |
SHA-256/224 | NIST/NSA | 2000 | ? |
SHA-512/384 | NIST/NSA | 2000 | ? |
SMASH | Knudsen | 2005 | broken |
Snefru-n | Merkle | 1990 | broken |
StepRightUp | Daemen | 1995 | broken |
SubHash | Daemen | 1992 | ? |
Tiger | Anderson, Biham | 1996 | broken |
VSH | Contini, Lenstra, Steinfeld, | 2005 | ? |
Whirlpool | Barreto and Rijmen | 2000 | ? |
Regarding the column cryptanalysis status, for simplicity reasons we take the following view. As soon as there are results suggesting that an expected property of a hash function is less than ideal, we list it as 'broken'. Resulting attacks may be by no means practical.
Note that the source for most of the data collected here (proposals and analysis results) is published in one of the following venues. Journal of Cryptology, IEEE Transactions on Information Theory, proceedings of IACR conferences like Crypto, Eurocrypt, Asiacrypt, FSE. Additionally also SAC, ISC, CT-RSA, PKCS, FIPS and ISO Standards are used.