Goodbye, SHA-1

Schneier gives more details on Wang’s attack on the SHA-1 algorithm.

We are clearly facing a crisis in hash functions.

Wang’s result shows they can get to an attack of complexity 2^63. The problem is that we are already able to attack problems of complexity 2^64.

The papers can be read here:

“Efficient Collision Search Attacks on SHA-0”

“Finding Collisions in the Full SHA-1Collision Search Attacks on SHA1”

Gulp.