An International Association for Cryptologic Research paper on SHA-1 theoretical weakness.
by Cameron McDonald, and Josef Pieprzyk, Centre for Advanced Computing, Algorithms and Cryptography Department of Computing, Macquarie University
Philip Hawkes, Qualcomm Australia, Level 3, 77 King St, Sydney 2000, Australia
Abstract: although SHA-1 has been theoretically broken for some time now, the task of ﬁnding a practical collision is yet to be completed. Using some new approaches to differential analysis, we were able to ﬁnd a new differential path which can be used in a collision attack with complexity of O(2 ^52). This is currently the lowest complexity attack on SHA-1.
Possibly Related Posts:
- Cass. Sez. II Penale – Sent. 29588
- Il vero “falso Klitschko” mette in crisi processi e identità digitale
- Per me gli Nft sono bolla irrazionale
- Turismo energetico da criptovaluta e crisi Kazakha. Problemi per l’AI italiana?
- Il blocco di Tor in Russia, la New IP policy cinese e la retorica della “internet libera”