network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 10 months |
| seen | Jun 20 '12 at 23:15 | |
| stats | profile views | 0 |
|
May 25 |
awarded | Popular Question |
|
Aug 3 |
awarded | Supporter |
|
Aug 3 |
awarded | Scholar |
|
Aug 3 |
accepted | What alphanumeric string length can be used to guarantee no hash collisions from CRC-64? |
|
Aug 3 |
comment |
What alphanumeric string length can be used to guarantee no hash collisions from CRC-64? wow... you blew my mind, is it true that CRC is an injective function? |
|
Aug 3 |
comment |
What alphanumeric string length can be used to guarantee no hash collisions from CRC-64? I can estimate that a collision is probable when N is greater than log(2^32)/log(62), or 5.374 characters, however I was looking for a guarantee. For example, if I take all single characters in this set and a null string, I can verify that there are no collisions. I'm guessing the only way to answer this is a brute-force test, but I'm hoping there's some literature out there that talks about collisions with a reduced input domain. any ideas? |
|
Aug 3 |
awarded | Student |
|
Aug 3 |
asked | What alphanumeric string length can be used to guarantee no hash collisions from CRC-64? |
