News for hackers. Stuff that matters.
Re:Announcing the first SHA-1 collision by bo1024 on Thursday February 23, 2017 @03:04PM (#13717238)
> UPDATE: some people are raising the possibility of hashes where some values have 1 or 0 preimages, which makes second and first preimage attacks formally impossible. Yes, such hashes are possible (in fact trivial) to construct, but they are not cryptographically secure. One of the requirements for a cryptographically secure hash is that all possible hash values are (more or less) equally likely.

True, but the main issue with these proposals is that we want hash functions that are much shorter than the original thing being hashed. For instance, we want every string of length one million bits to get hashed down to some string of length 4096. So those 2^4096 short hash strings can't mostly have 1 or 0 pre-images, in fact on average they have to have gazillions of pre-images each.

Re:Announcing the first SHA-1 collision by andreyf on Thursday February 23, 2017 @03:23PM (#13717408)
> in fact on average they have to have gazillions of pre-images each

pretty sure "on average" they have at least a few gazillion orders of magnitude more than a few gazillion pre-images each ;)

Re:Announcing the first SHA-1 collision by xapata on Thursday February 23, 2017 @05:28PM (#13718454)
You're saying the average of infinities is a gazillion gazillion?

For any hashcode, there are an infinite number of documents that would result in that hashcode.

Re:Announcing the first SHA-1 collision by andreyf on Friday February 24, 2017 @04:40PM (#13728179)
Nah, way bigger than that. I'm saying 10 times as big as a few gazillion at least a few gazillion times!

(key words are "at least")