News for hackers. Stuff that matters.
Re:Announcing the first SHA-1 collision by mikegerwitz on Thursday February 23, 2017 @01:01PM (#13716070)
A first-preimage attack just means you have H(P), find preimage P (where H is SHA1).

If you found preimage P and wanted another document that hashes into it (so, H(P) = H(P')), you'd have to perform a second-preimage attack and brute-force one. An "ideal" hash function is one where the only way to compute a second-preimage is through brute force. Due to the pidgeonhole principle, there will always be a second preimage---it's just whether it's computational feasible to compute it.

Re:Announcing the first SHA-1 collision by eridius on Thursday February 23, 2017 @01:41PM (#13716477)
> Due to the pidgeonhole principle, there will always be a second preimage

It's trivial to construct a hash function where this isn't true. However, it should be true for any cryptographically secure hash.