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. I suggest attentions on this issue. It will be necessary accomodate it to threat analysis and consider possible affection on the other ongoing works.
_______________________________________________ CGA-EXT mailing list [email protected] https://www.ietf.org/mailman/listinfo/cga-ext
