Comparison of cryptographic hash functions: Difference between revisions

Revision as of 17:06, 27 June 2011

Revision as of 19:36, 28 July 2011

Line 91:

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

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

! rowspan="2"|Operations<br /><ref group="cf">A: addition, subtraction; B: [[bitwise operation]]; L: [[lookup table]]; S: [[Bitwise_operations#Bit_shifts|shift, rotation]].</ref>

! rowspan="2"|[[Endianness|Endian]]<br /><ref group="cf">It refers to "byte" endianness only. If the operations consist of bitwise operations and lookup tables only, the endianness is irrelevant.</ref>

! rowspan="2"|Specification

|-

Line 100:

! 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>

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

! [[Merkle–Damgård construction#Security_characteristics|Length]]<br /><ref group="cf">The maximum input size = 2^{length size} - 1 [[bit]]s. For example, the maximum input size of SHA-1 = 2⁶⁴ - 1 bits.</ref>

|-

| [[HAVAL|HAVAL-3-128]]

Line 166:

| 48×18=864

| B

| n/a

| irrelevant

| RFC 1319

|-