News for hackers. Stuff that matters.

A comment on The first chosen-prefix collision for SHA-1. Parent comment

Re:The first chosen-prefix collision for SHA-1 by gpm on Tuesday January 07, 2020 @12:18PM (#21982025)
If the data is shorter than the hash shouldn't it be the same data I backed up with reasonably high probability?
[ Parent | on HN ]
Re:The first chosen-prefix collision for SHA-1 by dorgo on Tuesday January 07, 2020 @03:15PM (#21984301)
I guess you get (infinite?) many results which all have the same hash and one (or more) of them will be shorter than the hash.
[ Parent | on HN ]
Re:The first chosen-prefix collision for SHA-1 by pathseeker on Tuesday January 07, 2020 @01:17PM (#21982790)
No. http://matt.might.net/articles/counting-hash-collisions/
[ Parent | on HN ]
Re:The first chosen-prefix collision for SHA-1 by monktastic1 on Tuesday January 07, 2020 @01:39PM (#21983068)
Can 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").
[ Parent | on HN ]
Re:The first chosen-prefix collision for SHA-1 by DuskStar on Tuesday January 07, 2020 @01:42PM (#21983110)
That 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.

[ Parent | on HN ]