4 ms·
You might be able to find bytes that result in your hash, but they probably won't be the same bytes you 'backed up'.
by ksangeelee 7y ago
You might be able to find bytes that result in your hash, but they probably won't be the same bytes you 'backed up'.
- gpm 7y agoIf the data is shorter than the hash shouldn't it be the same data I backed up with reasonably high probability?
- pathseeker 7y agoNo. http://matt.might.net/articles/counting-hash-collisions/ http://matt.might.net/articles/counting-hash-collisions/
- monktastic1 7y agoCan you explain the relevance? If I put N items randomly into >> N buckets the chance of there being a second item in a particular bucket is small (as opposed to there merely being a bucket with two items, as in the birthday "paradox").
- DuskStar 7y agoThat doesn't apply here, since the birthday paradox is about the existence of a collision, not that any particular sequence collides. Most people in the room will still have unique birthdays even if one pair share theirs.
- deleted 7y ago[deleted]
- dorgo 7y agoI guess you get (infinite?) many results which all have the same hash and one (or more) of them will be shorter than the hash.