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:
- Protecting Personal Information. Una recensione su ZD – Zeitschrift für Datenschutz
- Chi non ha nulla da nascondere…
- La prefazione di Spaghetti Hacker
- Per un’analisi critica della natura giuridica delle criptovalute
- Un estratto da Codici Nascosti