From: John Feminella <johnf@...>
Date: 2011-03-16T13:57:15+09:00
Subject: Re: SHA1 Decryption!!

> You can't do this: there might be another location with the same hash.
> You have to prove (mathematically) that no two locations can have the
> same SHA1 hash.

The probability of this occurring is vanishingly small: the number of
possibilities is much less than the keyspace. Avoiding collisions is a
hallmark of robust hashing.

~ jf
--
John Feminella
Principal Consultant, BitsBuilder
LI: http://www.linkedin.com/in/johnxf
SO: http://stackoverflow.com/users/75170/



On Wed, Mar 16, 2011 at 00:43, Albert Schlef <albertschlef@gmail.com> wrote:
> Brian Candler wrote in post #987608:
>> 1000.times do |i|
>>   1000.times do |j|
>>     if Digest::SHA1.hexdigest("N59 52.%03d E017 42.%03d" % [i,j]) == TARGET
>>       raise "Whoo! #{i} #{j}"
>
> You can't do this: there might be another location with the same hash.
> You have to prove (mathematically) that no two locations can have the
> same SHA1 hash.
>
> --
> Posted via http://www.ruby-forum.com/.
>
>