Comparison of cryptographic hash functions: Difference between revisions

Revision as of 18:55, 23 November 2020

Latest revision as of 04:43, 24 May 2025

(13 intermediate revisions by 10 users not shown)

Line 1:

{{short description|Tables comparing general and technical information for common hashes}}

The following tables compare general and technical information for a number of [[cryptographic hash function]]sfunctions. See the individual functions' articles for further information. This article is not all-inclusive or necessarily up-to-date. An overview of hash function security/[[cryptanalysis]] can be found at [[hash function security summary]].

== General information ==

Line 17:

| Jean-Philippe Aumasson<br>Luca Henzen<br>Willi Meier<br>Raphael C.-W. Phan

| [[ChaCha20]]

| [https://131002.net/blake/ Website]<br>[https://web.archive.org/web/20201001184633/http://131002.net/blake/blake.pdf Specification]

|-

| [[BLAKE2]]

Line 72:

| [[RIPEMD]]

| 1992

| The RIPE Consortium<ref>{{cite conference|first1=Hans|last1=Dobbertin|author-link1=Hans Dobbertin|first2=Antoon|last2=Bosselaers|first3=Bart|last3=Preneel|author-link3=Bart Preneel|title=RIPEMD-160: A strengthened version of RIPEMD|conference=Fast Software Encryption. Third International Workshop|___location=Cambridge, UK|date=21–23 February 1996|pages=71–82|url=https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf|doi=10.1007/3-540-60865-6_44|doi-access=free}}</ref>

| [[MD4]]

|

Line 80:

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

| [[RIPEMD]]

| [httphttps://homes.esat.kuleuven.be/~bosselae/ripemd160.html Website]<br>[https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf Specification]

|-

| [[SHA-0]]

Line 135:

! data-sort-type=number | Length size

! data-sort-type=number | Word size

! data-sort-type=number | [[Round (cryptography)|Rounds]]

|-

| '''[[BLAKE2b]]'''

Line 154:

|-

| '''[[BLAKE3]]'''

| Unlimited{{notetag|It's technically 2⁶⁴ bytes which equals 2⁶⁷ bits<ref>https://github.com/BLAKE3-team/BLAKE3-specs/blob/master/blake3.pdf page 8</ref>}}

| Unlimited

| 256{{notetag|The full BLAKE3 incremental state includes a chaining value stack up to 1728 bytes in size. However, the compression function itself does not access this stack. A smaller stack can also be used if the maximum input length is restricted.}}

| 512

Line 210:

|-

| '''[[RadioGatún]]'''

| Unlimited{{notetag|RadioGatún is an Extendable[[extendable-Outputoutput Functionfunction]] which means it has an output of unlimited size. The official test vectors are 256-bit hashes. RadioGatún claims to have the security level of a cryptographic [[sponge function]] 19 words in size, which means the 32-bit version has the security of a 304-bit hash when looking at [[preimage attack]]s, but the security of a 608-bit hash when looking at [[collision attack]]s. The 64-bit version, likewise, has the security of a 608-bit or 1216-bit hash. For the purposes of determining how vulnerable RadioGatún is to [[length extension attack]]s, only two words of its 58-word state are output between hash compression operations.}}

| 58 words

| 19 words{{notetag|RadioGatún is not a Merkle–Damgård construction and, as such, does not have a block size. Its belt is 39 words in size; its mill, which is the closest thing RadioGatún has to a "block", is 19 words in size.}}

Line 547:

{{Cryptography navbox|hash}}

[[Category:Cryptography]]

[[Category:Cryptographic primitives]]

[[Category:Cryptographic hash functions| ]]