SHA-1 Cryptanalysis Breakthrough
August 26th, 2005
It was announced last week at the 25th Annual International Cryptology Conference in California that there has been a further breakthrough in the cryptanalysis of the SHA-1 algorithm. Professor Xiaoyun Wang, Andrew Yao and Frances Yao have demonstrated that collisions can be found in 2^63 operations, improving upon the 2^69 findings announced in February this year.
Original post by blog@rsa.com (Burt Kaliski) and software by Elliott Back