Timeline for Do a 160-bit SHA-1 hash and a 160-bit slice of a SHA-256 hash have the same strength in terms of collision-free?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2020 at 12:29 | comment | added | OrangeDog | Now there's a demonstrated chosen plaintext collision too. | |
| Dec 17, 2019 at 13:01 | comment | added | user3332315 | @Maarten-reinstateMonica Thank you for the addition. | |
| Dec 17, 2019 at 12:36 | comment | added | Maarten Bodewes♦ | Also note that trying to find a key pair that matches the fingerprint of a particular key is still very (prohibitively) expensive, as the birthday bound would not apply. However, you could worry about large organizations trying to find key pairs that could match large amounts of key pairs. Shattered attacks don't work for pre-generated key pairs. So although above answer is correct w.r.t. collision resistance, there are quite a few things to consider when it comes to fingerprints (for OpenPGP compatible keys). | |
| Dec 15, 2019 at 7:47 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Dec 14, 2019 at 18:17 | history | edited | kelalaka | CC BY-SA 4.0 |
added explanation for the reduced version.
|
| Dec 13, 2019 at 20:44 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Dec 13, 2019 at 11:10 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Dec 13, 2019 at 9:17 | history | edited | kelalaka | CC BY-SA 4.0 |
fix the link
|
| Dec 13, 2019 at 8:09 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Dec 13, 2019 at 7:51 | history | edited | kelalaka | CC BY-SA 4.0 |
polish
|
| Dec 13, 2019 at 7:44 | history | answered | kelalaka | CC BY-SA 4.0 |