Quickly generate various hashing algorithms of string in online directly from your web browser. The supported hashing algorithm are: MD2 / MD4 / MD5 / SHA1 / SHA224 / SHA256 / SHA384 / SHA512 / RIPEMD128 / RIPEMD160 / RIPEMD256 / RIPEMD320 / WHIRLPOOL / TIGER128,3 / TIGER160,3 / TIGER192,3 / TIGER128,4 / TIGER160,4 / TIGER192,4 / SNEFRU / SNEFRU256 / GOST / ADLER32 / CRC32 / CRC32B / FNV132 / FNV164 / JOAAT / 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
This MD5 hash generator is useful for encoding passwords, credit cards numbers and other sensitive date into MySQL, Postgress or other databases. PHP programmers, ASP programmers and anyone developing on MySQL, SQL, Postgress or similar should find this online tool an especially handy resource.
An MD5 hash is created by taking a string of an any length and encoding it into a 128-bit fingerprint. Encoding the same string using the MD5 algorithm will always result in the same 128-bit hash output. MD5 hashes are commonly used with smaller strings when storing passwords, credit card numbers or other sensitive data in databases such as the popular MySQL. This tool provides a quick and easy way to encode an MD5 hash from a simple string of up to 256 characters in length.
MD5 hashes are also used to ensure the data integrity of files. Because the MD5 hash algorithm always produces the same output for the same given input, users can compare a hash of the source file with a newly created hash of the destination file to check that it is intact and unmodified.
An MD5 hash is NOT encryption. It is simply a fingerprint of the given input. However, it is a one-way transaction and as such it is almost impossible to reverse engineer an MD5 hash to retrieve the original string.
A hash function is any function that can be used to map data of arbitrary size to data of fixed size. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. One use is a data structure called a hash table, widely used in computer software for rapid data lookup. Hash functions accelerate table or database lookup by detecting duplicated records in a large file. An example is finding similar stretches in DNA sequences. They are also useful in cryptography. A cryptographic hash function allows one to easily verify that some input data maps to a given hash value, but if the input data is unknown, it is deliberately difficult to reconstruct it (or equivalent alternatives) by knowing the stored hash value. This is used for assuring integrity of transmitted data, and is the building block for HMACs, which provide message authentication.
Hash functions are related to (and often confused with) checksums, check digits, fingerprints, lossy compression, randomization functions, error-correcting codes, and ciphers. Although these concepts overlap to some extent, each has its own uses and requirements and is designed and optimized differently. The Hash Keeper database maintained by the American National Drug Intelligence Center, for instance, is more aptly described as a catalogue of file fingerprints than of hash values.