lundi 14 novembre 2005, par
Ahmed Reda KACED
we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 2^69 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound.
