Re^2: Digest (checksum) Algorithm for 12 Decimal Digits?

Doesn't it mean that if I truncate data, I'll be exposing myself to higher risk of having different data generating the exact same digest value?

I believe that is true, but maybe the risk is still so small as to be negligable!?!

Comment on Re^2: Digest (checksum) Algorithm for 12 Decimal Digits?

Replies are listed 'Best First'.
Re^3: Digest (checksum) Algorithm for 12 Decimal Digits? by oha (Friar) on Oct 05, 2007 at 16:12 UTC
suppose you have a 3 bit hash function: the best is if all the value populate the 8 possibilities in equal density. now you remove 1 bit. it means that you have only 4 buckets now, and being the result of the union of two who are equal density, they are equal density. IOW, if the hash function you used was good, the result is good. Oha	[reply]