Finding Collisions in the Full SHA-1

http://www.theregister.co.uk/2005/08/19/sha-1_attack/

Crypto researchers have discovered a new, much faster, attack against
the widely-used SHA-1 hashing algorithm. Xiaoyun Wang, one of the team
of Chinese cryptographers that demonstrated earlier attacks against
SHA-0 and SHA-1, along with Andrew Yao and Frances Yao, have discovered
a way to produce a collision in SHA-1 over just 263 hash operations
compared to 269 hash operations previously. A brute force attack should
take 280 operations.

Vi rimando al pdf:

http://www.infosec.sdu.edu.cn/paper/sha1-crypto-auth-new-2-yao.pdf

	   				Gaetano

-- 
Gaetano Zappulla		           http://www.linux.it/~gaetano/
mail : echo "d^bq^kl=pfhrobww^+lod" | perl -pe 's/(.)/chr(ord($1)+3)/ge'

________________________________________________________
http://www.sikurezza.org - Italian Security Mailing List