Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
Suppose I have one URL.
http://google.com ...I'd like to turn it into a hash. S3jvZLSDK.
Then take this hash and reverse it! into http://google.com.
To you geeks out there--what is the BEST method to do this for near-ZERO collision?
If you can reverse it, then by definition it isn't a hash. It's an encoding. Any encoding will have zero collisions (otherwise it wouldn't be able to accurately reverse it).
A common encoding for this purpose is base64.
The whole point of a hash is that it isn't reversible (short of brute-force, trying every possible input until the output matches).
Is this for a URL shortening service? The usual way of doing this is to store http://google.com in a database under a unique key, and when someone queries with that key (which could be ‘S3jvZLSDK’ if you really like random strings, but could just as easily be ‘1’) you spit the value you remembered back out again.
Are you trying to write something like a URL shortener? If so, just generate a random string, then use a big hash table, relational database (with indexes), etc. to relate keys (S3jvZLSDK) to URLs (google.com) and vice versa.
That will give you an easy solution for handling collisions (key already exists, URL already exists) and fast lookups.
There is no way to get near-zero collisions, but you can make collisions arbitrarily unlikely if you use a cryptographic hash with a large output size. The SHA-2 family contains a version with a 512 bit key; that should do you.
