in reply to Re: Digest (checksum) Algorithm for 12 Decimal Digits?
in thread Digest (checksum) Algorithm for 12 Decimal Digits?
The digits must decimal because some downstream code that is out of my control, requires it. :-(
I think I understand what oha is trying to tell me, but I still have a nagging doubt. Let's see if I can explain this doubt rationally, without having any evidence or support for it :-)
I like the "bucket" analogy, and I agree that a good algorithm should be able to evenly distribute among all the buckets available to it in equal density.
What I'm not so sure about is that if I remove some bits from the result, does that mean I've reduced the number of buckets and preserved the algorithms bucket-distribution-equality? For some reason I think this answer is no (remember - I have no evidence or facts to back me up here... it's just a feeling).
Also, does it matter which bits I dump? Most significant? Least significant? Random bunny-hop among all the bits?
-Craig
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: Digest (checksum) Algorithm for 12 Decimal Digits?
by syphilis (Archbishop) on Oct 06, 2007 at 02:20 UTC |