Hash'em all!
Free online text & file hashing
 What is a hash function?

A cryptographic hash function, in a nutshell, is a mathematical function which computes a kind of "digital fingerprint" of a sequence of bytes. It's always possibile to compute a fingerprint, even for very long or zero-sized byte sequences (try to hash empty strings with Hash'em all!); however, it's not possible to compute the original data from a given fingerprint. If we change the input sequence in just one bit, the resulting hash will be completely different; but one of the most important mathematical properties of hash functions is that it's very, very difficult to find two different sequences of bytes with the same fingerprint. You can try to hash several different strings with Hash'em all! until you find a collision... if you have much, much time to waste :)

This was a very short introduction to hash functions. Googling you will find plenty of detailed informations about them; but a good start may be Wikipedia:
 Why I shall hash something?

You may find Hash'em all! useful mainly for:
If there's a different reason why you find Hash'em all! useful, just let me know: I'll be happy to add it in this list.

Warning: because of a bug in Internet Explorer, this website may seem ugly with IE. Please consider to view this site with Firefox, Konqueror, Opera or other standard-compliant browsers. Thank you.

I would like to offer you Hash'em'all! always for free.
If you liked it, please consider giving a little help. Thank you!
All rights reserved. All trademarks are of respective owners. This service is totally free and it is available for use "as is"; mantainers don't have any responsability in case of incorrect or missing data. For informations or comments please contact info@hashemall.com.

Valid HTML 4.01 Transitional Valid CSS 2.1 Ugly on IE, but not for my fault
Article on ULB