17 August, 2005

SHA-1 attack complexity reduced

At the CRYPTO 2005 Rump Session, Adi Shamir just delivered a new result on behalf of Xiaoyun Wang, Andrew Wao and Frances Wao, on SHA-1. The complexity of the best attack for finding collisions is lowered from 269 to 263. Shamir speculates that it might now be plausible to search for SHA-1 collisions using a distributed Internet search.


Post a Comment

<< Home