A hash function takes a group of characters (a key) and maps it to a value of fixed length. This value is called a hash, hash value, hash code or hash sum. There are many algorithms for creating hashes, but they all share some common properties. Determinism: for a given input, the function must always generate the same output. Uniformity: the inputs should be mapped to the possible output range as evenly as possible. Non-invertible: it should not be realistic to recreate the input data from the hash value.
Hash functions have many uses. They are for example used in hash tables to quickly find data records. They are also used to determine if two objects are equal. Another common use of hash functions is to create digital fingerprints of messages to ensure that they have not been altered.
This tool can generate hashes using the following algorithms: md2, md4, md5, sha1, sha224, sha256, sha384, sha512/224, sha512/256, sha512, sha3-224, sha3-256, sha3-384, sha3-512, ripemd128, ripemd160, ripemd256, ripemd320, whirlpool, tiger128,3, tiger160,3, tiger192,3, tiger128,4, tiger160,4, tiger192,4, snefru, snefru256, gost, gost-crypto, adler32, crc32, crc32b, crc32c, fnv132, fnv1a32, fnv164, fnv1a64, joaat, murmur3a, murmur3c, murmur3f, xxh32, xxh64, xxh3, xxh128, haval128,3, haval160,3, haval192,3, haval224,3, haval256,3, haval128,4, haval160,4, haval192,4, haval224,4, haval256,4, haval128,5, haval160,5, haval192,5, haval224,5, haval256,5