[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[saag] improvement on finding SHA-1 collissions



I believe someone already know this but just for the general audience:
It has just been anounced on rump session of Eurocrypt2009 that complexity of finding SHA-1 collision has been reduced to 2^52.
http://eurocrypt2009rump.cr.yp.to/837a0a8086fa6ca714249409ddfae43d.pdf
Detailed paper hopefully will appear soon on eprint. 
 

Note Well: Messages sent to this mailing list are the opinions of the senders and do not imply endorsement by the IETF.