Unkeyed Hash Functions
A hash function, otherwise known as a one-way hash function, takes an arbitrary message of arbitrary length and creates an output (a hash) of a fixed length. The main characteristics of a cryptographic hash function are that given a message, it is easy to compute the hash; given the hash, it is difficult to compute the message; and that given a message, it is difficult to find a different message that would produce the same hash (this is known as a collision). An unkeyed hash function takes just a message as input and outputs a fixed-length hash.
Parameters
- n: length of message
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 6 of 6 algorithms
| See more | ||||
|---|---|---|---|---|
| SHA-3 | 2015 | auxiliary | ||
| SHA-2 | 2001 | |||
| bcrypt | 1999 | auxiliary | ||
| RIPEMD-160 | 1996 | |||
| SHA-1 | 1993 | |||
| MD5 | 1991 |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table