Subject: [CGA-EXT] improvement on finding SHA-1 collissions

From: shenshuo <[email-masked]>
Date: Wed, 06 May 2009 09:50:47 +0800

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.