Re: md5() algorithm, probabilities

w>> said that if the pass phrase entered is long enough, the resulting MD5 w>> hash will be statisically random. w>> That does not say anything about matching hashes in relation to string w>> length. Being statistically random means probability of two strings to collide is the same as probability of two random hashes to collide, IIRC. I.e., 1/2^$LENGTH_OF_THE_HASH. If you interested in *real* analysis, just take Shneier's Applied Cryptography, 2ed, and study :) -- Stanislav Malyshev stas@zend.com +972-3-6139665