isnt RC5-64 a bit useless?
I am no Dcomputing or cryptography 'guru' or anything, but my understanding of the challenge goes something like this
there is an message encrypted using a 64bit key that d.net is trying to crack by brute force (ie, using every single possible combination)
Now, there are a finite number of keys, namely 2^64 or 1.844674407371e+19. Now, by having a rate of 141 470 000 000 keys per second it would take 130393327728 seconds or 4135 years to solve the encryption. Now, knowing all that, why would you continue to crack? from the recent TA article, it seems that OGR is a much more useful job for your spare cycles.
Even if you wanted to crack stuff, why not take up a REAL challenge and try and crack 128bit encryption? Now that will take you 2.405332345522e+27 seconds or 76 Exa Years!!! That is 76 272 588 328 310 000 000 years!!! Long time...
I am no Dcomputing or cryptography 'guru' or anything, but my understanding of the challenge goes something like this
there is an message encrypted using a 64bit key that d.net is trying to crack by brute force (ie, using every single possible combination)
Now, there are a finite number of keys, namely 2^64 or 1.844674407371e+19. Now, by having a rate of 141 470 000 000 keys per second it would take 130393327728 seconds or 4135 years to solve the encryption. Now, knowing all that, why would you continue to crack? from the recent TA article, it seems that OGR is a much more useful job for your spare cycles.
Even if you wanted to crack stuff, why not take up a REAL challenge and try and crack 128bit encryption? Now that will take you 2.405332345522e+27 seconds or 76 Exa Years!!! That is 76 272 588 328 310 000 000 years!!! Long time...