given a 32 digits hex number that is random enough. If i pass it thru md5, is the result more random or less?
few years back, i wrote a function to generate UUID, here: Emacs Lisp: Insert Random ID, Random UUID
I was simply calling random number function in emacs. Christopher Wellons improved it by first gather bunch of random info such as time, user's name, last keystroke typed, etc, then, feed it to md5, then basically use that result as UUID.
The question is, would that actually improve the function? That is, reduce the chances of generating the same UUID?
If you begin with random info such as time and user's last few keystrokes, then yes. But the step i don't quite understand is md5.
md5 takes arbitrary text and returns a 32 digits hexadecimal. Most or all other “hash function” do the same, that is, take a arbitrarily long or short text as input, and returns a fixed number of digits. But the interesting question is, such thing is mathematically impossible. Somewhat like a pigeon hole principle. You can never take many things and produce less things such that it is always unique for every input. The gist of “hash function” is about the impossibility of generating the input given the output. But, i don't know what's the uniqueness property.