Content deleted Content added
Evgeny Kapun (talk | contribs) Big cleanup |
m Bot: http → https |
||
| (30 intermediate revisions by 16 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 == General information ==
Line 16 ⟶ 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]]
| 2012
| Jean-Philippe Aumasson<br>Samuel Neves<br>[[
| [[BLAKE (hash function)|BLAKE]]
| [https://blake2.net/ Website]<br>[https://blake2.net/blake2.pdf Specification]<br>{{IETF RFC|7693}}
|-
| [[BLAKE3]]
| 2020
| Jack O'Connor<br>Jean-Philippe Aumasson<br>Samuel Neves<br>[[Zooko Wilcox-O'Hearn]]
| [[BLAKE2]]
| [https://github.com/BLAKE3-team/BLAKE3 Website]<br>[https://github.com/BLAKE3-team/BLAKE3-specs/blob/master/blake3.pdf Specification]
|-
| [[GOST (hash function)|GOST R 34.11-94]]
Line 65 ⟶ 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 73 ⟶ 80:
| [[Hans Dobbertin]]<br>Antoon Bosselaers<br>[[Bart Preneel]]
| [[RIPEMD]]
| [
|-
| [[SHA-0]]
Line 79 ⟶ 86:
| rowspan="4"|[[National Security Agency|NSA]]
|
| [https://web.archive.org/web/20090130063617/http://w2.eff.org/Privacy/Digital_signature/?f=fips_sha_shs.info.txt SHA-0]
|-
| [[SHA-1]]
Line 122 ⟶ 129:
{| class="wikitable sortable" style="text-align: center"
|-
! data-sort-type=text | Algorithm
! data-sort-type=number | Output size (bits)
! data-sort-type=number | Internal state size{{notetag|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.}}
! data-sort-type=number | Block size
! data-sort-type=number | Length size
! data-sort-type=number | Word size
! data-sort-type=number | [[Round (cryptography)|Rounds]]
|-
| '''[[BLAKE2b]]'''
| 512
| 512
|
| 128{{notetag|The size of BLAKE2b's message length counter is 128-bit, but it counts message length in bytes, not in bits like the other hash functions in the comparison. It can hence handle eight times longer messages than a 128-bit length size would suggest (one byte equaling eight bits). A length size of 131-bit is the comparable length size (<math>8 \times 2^{128} = 2^{131}</math>).}}
| 64
| 12
Line 140 ⟶ 147:
| '''[[BLAKE2s]]'''
| 256
| 512▼
| 256
|
| 64{{notetag|The size of BLAKE2s's message length counter is 64-bit, but it counts message length in bytes, not in bits like the other hash functions in the comparison. It can hence handle eight times longer messages than a 64-bit length size would suggest (one byte equaling eight bits). A length size of 67-bit is the comparable length size (<math>8 \times 2^{64} = 2^{67}</math>).}}
| 32
| 10
|-
| '''[[BLAKE3]]'''
| Unlimited{{notetag|It's technically 2<sup>64</sup> bytes which equals 2<sup>67</sup> bits<ref>https://github.com/BLAKE3-team/BLAKE3-specs/blob/master/blake3.pdf page 8</ref>}}
| 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
| 64
| 32
| 7
|-
| '''[[GOST (hash function)|GOST]]'''
Line 157 ⟶ 172:
| 256/224/192/160/128
| 256
|
| 64
| 32
Line 188 ⟶ 203:
| '''[[PANAMA]]'''
| 256
|
| 256
| –
Line 195 ⟶ 210:
|-
| '''[[RadioGatún]]'''
| Unlimited{{notetag|RadioGatún is an
| 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 261 ⟶ 276:
| 384/512/224/256
| 512
|
| 128
| 64
Line 269 ⟶ 284:
| 224/256/384/512{{notetag|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.}}
| 1600
| 1600 - 2*bits
| –{{notetag|Implementation dependent; as per section 7, second paragraph from the bottom of page 22, of FIPS PUB 202.}}
| 64
| 24
Line 499 ⟶ 514:
| [[Tiger (hash function)|Tiger-128]]
| {{nowrap|×2 {{=}} 128}}
|-
! rowspan="2" | Function
! [[Word (computer architecture)|Word]]
! [[Cryptographic hash function|Digest]]
! [[Merkle–Damgård construction|Chaining<br>values]]
! Computation<br>values
! [[Merkle–Damgård construction|Block]]
! [[Merkle–Damgård construction#Security characteristics|Length]]
! rowspan="2" | Words ×<br>Passes =<br>Rounds
! rowspan="2" | Operations
! rowspan="2" | [[Endianness|Endian]]
|-
! colspan="6" | Size ([[bit]]s)
|}
Line 513 ⟶ 541:
== External links ==
* [https://bench.cr.yp.to/results-hash.html ECRYPT Benchmarking of Cryptographic Hashes] – measurements of hash function speed on various platforms
* [https://ehash.iaik.tugraz.at/wiki/The_eHash_Main_Page The ECRYPT Hash Function Website] – A wiki for cryptographic hash functions
* [https://csrc.nist.gov/projects/hash-functions/sha-3-project SHA-3 Project] – Information about SHA-3 competition
Line 518 ⟶ 547:
{{Cryptography navbox|hash}}
[[Category:Cryptographic primitives]]
[[Category:Cryptographic hash functions| ]]
| |||