Comparison of cryptographic hash functions: Difference between revisions

Revision as of 01:51, 27 December 2008

Revision as of 04:55, 27 December 2008

Line 3:

== General information ==

Basic general information about the [[cryptographic hash functionsfunction]]s: year, designer, references, etc. The column "Year" refers to the first official description of the algorithm, not designed date.

{| class="sortable wikitable" style="text-align: center"

|-

! Function

Line 14:

| [[HAVAL]]

| 1992

| [[Yuliang Zheng]],<br />[[Josef Pieprzyk]],<br />[[Jennifer Seberry]]

|

| [http://labs.calyptix.com/haval.php Website]

Line 20:

| [[MD2]]

| 1989

| rowspan="3"|[[Ronald Rivest]]

|

| RFC 1319

|-

| [[MD4]]

| 1990

|

| [[Ronald Rivest]]

|

| RFC 1320

|-

| [[MD5]]

| 1992

| [[MD4]]<refbr />RFC 1321 page 1</ref>

| [[Ronald Rivest]]

| [[MD4]]<ref>RFC 1321 page 1</ref>

| RFC 1321

|-

| [[RIPEMD]]

| 1990

| The RIPE Consortium<ref>[http://homes.esat.kuleuven.be/~bosselae/ripemd160.html#What</ref>]

|

|

|-

| [[RIPEMD-128|]]<br />[[RIPEMD-128/256]]<br />[[RIPEMD-160]]<br />[[RIPEMD-320]]

| 1996

| [[Hans Dobbertin]], [[Antoon Bosselaers]], [[Bart Preneel]]

| [[RIPEMD]]<ref>http://homes.esat.kuleuven.be/~bosselae/ripemd160.html#What</ref>

| [http://homes.esat.kuleuven.be/~bosselae/ripemd160.html Website]

|-

| [[RIPEMD-160|RIPEMD-160/320]]

| 1996

| [[Hans Dobbertin]],<br />[[Antoon Bosselaers]],<br />[[Bart Preneel]]

| [[RIPEMD]]<ref>[http://homes.esat.kuleuven.be/~bosselae/ripemd160.html#What</ref>]

| [http://homes.esat.kuleuven.be/~bosselae/ripemd160.html Website]

|-

| [[SHA-0]]

| 1993

| rowspan="4"|[[National Security Agency|NSA]]

|

| [http://w2.eff.org/Privacy/Digital_signature/?f=fips_sha_shs.info.txt SHA-0]

Line 62 ⟶ 54:

| [[SHA-1]]

| 1995

| [[National Security Agency|NSA]]

| [[SHA-0]]

| rowspan="3"|[http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf FIPS 180--3]

|-

| [[SHA-2|256]]<br />[[SHA-256512]]<br /224>[[SHA-384]]

| 2002/2004

| [[National Security Agency|NSA]]

|

| [http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf FIPS 180--3]

|-

| [[SHA-2|SHA-512/384]]

| 2002

| rowspan="2"|

| [[National Security Agency|NSA]]

|-

| [[SHA-2|SHA-512/384224]]

| [http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf FIPS 180--3]

| 2002/2004

|-

| [[Tiger (cryptography)|Tiger(2)-192]]<br />[[Tiger (cryptography)|Tiger-160]]<br />[[Tiger (cryptography)|Tiger-128]]

| 1995

| [[Ross Anderson]],<br />[[Eli Biham]]

|

| [http://www.cs.technion.ac.il/~biham/Reports/Tiger/ Website]

Line 86 ⟶ 72:

| [[Whirlpool (cryptography)|Whirlpool]]

| 2004

| [[Vincent Rijmen]],<br />[[Paulo Barreto]]

|

| [http://www.larc.usp.br/~pbarreto/WhirlpoolPage.html Website]

Line 92 ⟶ 78:

== Compression function ==

The following tables compare technical information for compresion functions of [[cryptographic hash function]]s. The information comes from the specifiations, please reference them for more details. All size counts [[bit]]s, not [[byte]]s. And '''the omitted multiplicands are word sizes.'''

{| class="wikitable" style="text-align: center"

|-

! rowspan="2"|Function

! colspan="6"|Size ([[bit]]s)<ref group="cf">The omitted multiplicands are word sizes.</ref>

! rowspan="2"|Block words<br />×Passes<br />=Rounds<ref group="cf">Some authors interchange passes and rounds.</ref>

! rowspan="2"|Specification

|-

! [[Word_(computing)|Word]]

! [[Cryptographic hash function|Digest]]

! Digest

! [[Merkle–Damgård construction|Chaining<br />values]]<ref group="cf">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.</ref>

! Chaining<br />variables

! Computation<br />values<ref group="cf">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.</ref>

! Temporary<br />variables

! [[Merkle–Damgård construction|Block]]

! Block

! [[Merkle–Damgård construction#Security_characteristics|Length]]<ref group="cf">The maximum input size=2^length size-1. For example, the maximum input size of SHA-1=2^64-1=16[[Exbibit|Eib]]-1[[Exbibit|Eib]].</ref>

! Length

! Block Words<br />×Passes<br />=Rounds

! Specification

|-

| [[MD4]]

Line 181 ⟶ 169:

| ×2=128

|}

=== Notes ===

<references group="cf" />

== See also ==

*[[List_of_hash_functions]]

*[[Word_(computing)]]

== References ==

<references/>

== External links ==

# [http://www.larc.usp.br/~pbarreto/hflounge.html The Hash function lounge] — a list of hash functions and known attacks, by Paulo Barreto

# [http://www.hashemall.com/ Hash'em all!] — free online text and file hashing with different algorithms

# [http://www.larc.usp.br/~pbarreto/hflounge.html The Hash functionFunction loungeLounge] — a list of hash functions and known attacks, by Paulo Barreto

{{Crypto navbox | hash}}