Re: Questions on SHA-1

"bren[at]gillatt.org" <bren@gillatt.org> wrote in message
news:dohfnp$sm3$1@news.freedom2surf.net...
>
>> It's a bit more complicated than the above, but the general idea is
>> that for a k-bit hash, finding a collision takes around 2**(k/2)
>> operations.
>
> If someone was REALLY bored they could put together a simple C script and
> leave it running for a LONG time :S

2^80 is not inconceivable. My calculator says if you could do 1 billion
calculations a second you should be able to get 2^80 in about 38 million
years.

--
LTP
:)