Hashing functions
From Wikipedia, the free encyclopedia:
A cryptographic hash function is a hash function; that is, an algorithm that takes an arbitrary block of data and returns a fixed-size bit string, the (cryptographic) hash value, such that an (accidental or intentional) change to the data will (with very high probability) change the hash value. The data to be encoded are often called the "message," and the hash value is sometimes called the message digest or simply digest.
The generator below will outpur the Hash value of the input string for all currently supported hash algorithms simultaneously.
| Footnotes |
|---|
|
The number in brackets (n) indicates the number of rounds (3, 4, or 5) to be used to generate the hash for functions that support this option. |