( 09th August 2019 )
Regarding Cryptographic hash functions, following tables compare general and technical information for a number of cryptographic hash functions. An overview of hash function security/cryptanalysis can be found at hash function security summary.
Fig 1: Comparision of Cryptographic Hash Functions
Fig 2: Comparision of Cryptographic Hash Functions
Parameters:
Fig 3: Comparision of Cryptographic Hash Functions
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 Damgard construction for details.
RadioGatun is an Extendable-Output Function which means it has an output of unlimited size. The official test vectors are 256-bit hashes. RadioGatun 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 attacks, but the security of a 608-bit hash when looking at collision attacks. The 64-bit version, likewise, has the security of a 608-bit or 1216-bit hash. For the purposes of determining how vulnerable RadioGatun is to length extension attacks, only two words of its 58-word state are output between hash compression operations.
RadioGatun is not a Merkle Damgard construction and, as such, does not have a block size. Its belt is 39 words in size; its mill, which is the closest thing RadioGatun has to a "block", is 19 words in size. Only the 32-bit and 64-bit versions of RadioGatun have official test vectors. The 18 blank rounds are only applied once in RadioGatun, between the end of the input mapping stage and before the generation of output bits
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.
Fig 4: 224, 256, 384 and 512 bits output as valid modes for SHA-3
The omitted multiplicands are word sizes.
Some authors interchange passes and rounds.
A: addition, subtraction; B: bitwise operation; L: lookup table; S: shift, rotation.
It refers to byte endianness only. If the operations consist of bitwise operations and lookup tables only, the endianness is irrelevant.
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.
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 computation values and then combine into a single set of chaining values.
The maximum input size = 2length size, 1 bit. For example, the maximum input size of SHA-1 = 264, 1 bit.
Comments