Page 1 of 1
usage of sha1() function
Posted: Mon Apr 19, 2004 3:10 am
by davidklonski
Hello
I have a theoretical question regarding how sha1() works.
Is it theoretically possible for sha1() to return the same output for two different input strings?
thanks
Re: usage of sha1() function
Posted: Mon Apr 19, 2004 11:04 am
by Roja
davidklonski wrote:Hello
I have a theoretical question regarding how sha1() works.
Is it theoretically possible for sha1() to return the same output for two different input strings?
thanks
Theoretically, yes, it is possible for there to be a collision.
The odds are 2^(n/2), where n, in the case of SHA1, would be 160 (bits). (It would be 2^n, but there is an issue called the 'birthday paradox', which is important here, which lowers it to 2^(n/2))
Thats over one septillion possibilities. Since the peak of the distributed RSA challenge saw 7 billion keys per second, that means it would take distributed.net roughly 1.9 million days to find it.
I'd say thats pretty solid.
Posted: Mon Apr 19, 2004 5:22 pm
by llanitedave
Hopefully, by the time 1.9 million days have passed, the password will have changed!

Posted: Wed Apr 21, 2004 12:30 pm
by JAM
Welcome back <username>!
FYI, You have 1.874.601 days, 21 hours, 14 minutes and 02 seconds left before You need to renew your password...

Posted: Wed Apr 21, 2004 12:46 pm
by feyd
bahahah
