Comparison of cryptographic hash functions: Difference between revisions

Revision as of 18:47, 7 February 2019

Revision as of 01:18, 9 July 2019

Line 122:

{| 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 | Rounds

|-

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