| bio | website | peerassembly.com |
|---|---|---|
| location | Ireland | |
| age | 51 | |
| visits | member for | 1 year |
| seen | May 16 '12 at 10:40 | |
| stats | profile views | 1 |
Interested in lots of computer languages (most recently ruby, haskell, java, objective-c, c++)
|
May 12 |
awarded | Supporter |
|
May 12 |
awarded | Scholar |
|
May 12 |
comment |
Is it fair to assume that SHA1 collisions won't occur on a set of <100k strings Thanks all. Note that I'm not worried about deliberate attempts at causing collisions, just likelihood of them occurring by chance. |
|
May 12 |
accepted | Is it fair to assume that SHA1 collisions won't occur on a set of <100k strings |
|
May 12 |
comment |
Is it fair to assume that SHA1 collisions won't occur on a set of <100k strings Sadly, I need paths generated on different machine to hash to the same value. The creation times are not persisted to nanosecond resolution (and in any case I would think this actually has a higher chance of collision than the hash function). |
|
May 11 |
awarded | Student |
|
May 11 |
asked | Is it fair to assume that SHA1 collisions won't occur on a set of <100k strings |
|
May 11 |
awarded | Autobiographer |