Re: Finding Collisions in the Full SHA-1

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Gaetano Zappulla wrote:

> 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 2^63
> hash operations compared to 2^69 hash operations previously. A
> brute force attack should take 2^80 operations.
>
> Vi rimando al pdf:
> http://www.infosec.sdu.edu.cn/paper/sha1-crypto-auth-new-2-yao.pdf

Stranamente questo (lentisismo) link rimanda a un contenuto identico a
quello indicato da s4tan il 25 giugno, il cui abstract sostiene:
We show that collisions of SHA-1 can be found with complexity less
than 2^69 hash operations.
(nessun riferimento a metodi da 2^63, mi pare)

Suppongo che l'articolo di TheRegister indicasse il vecchio documento
dato che il nuovo attacco ancora non è statopubblicato?

- --
Lapo Luchini
[email protected] (OpenPGP & X.509)
www.lapo.it (ICQ UIN: 529796)
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.1 (Cygwin)
Comment: Using GnuPG with Thunderbird - http://enigmail.mozdev.org

iQIcBAEBAgAGBQJDB4jOAAoJELBiMTth2oCDApMP/iJ02806QaPq7RcUhFJKnEEV
uerK7eF9GnCT766XMN1QXUtB6EbHrcEekYlbEKPhywdLZTe14zDcppnOFD7Uf6cT
lYzJdYuayt/h1phiBfcQ+UmjD2OhoK+dA3aBEoIG4Molue8NPYpfzagMWqnriL8F
/kQs9VY+Hod6/oMP890md6wUyE+7jlaHIQGGy4FJPQW0FlHps876GznP2HGmOmBT
m7SGNKo+h9F4/gJlmRXmavy/IjwFS/AMI8rupyEN/Z9b266A/fejal/t2hFMRpl3
7wf0RC38i2Bw6BGveg+Rn2uKmkjFIr45FDfjzKqcke1EQrZSWnbEYD6QxuY2htHN
UtEhEfjeTruWhK6ZiTa/MQ8gerYgZSd5aQC/hKeh1w0aScbaKJ8m0NZsXxUjkJst
VQop1FmR5IMJcFwd9Btv7Uia+WsG0+3B4ZI63snRR0mlN4p2NYsS/RtsZkT5ULhd
D60bkzyciF3HR1TWLZftjoWemVGe75PHiOJBnrKlo7qTTUGKCPRvDUmxam60eLz/
sawY4YbyQZIr5F7L4P/2QntKp7xZb9Xm9DXPGMPgL8vx1Jjqzcaou4LDds9pSrga
GYr5wQQ82cc/e97IFSjIfa2L4fv2rtE9NGJST8XEByFjU2U6G03HiVEFouyHS55v
UZ7JkfZLKSBpLnStX0kL
=mQqD
-----END PGP SIGNATURE-----

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