• We’re currently investigating an issue related to the forum theme and styling that is impacting page layout and visual formatting. The problem has been identified, and we are actively working on a resolution. There is no impact to user data or functionality, this is strictly a front-end display issue. We’ll post an update once the fix has been deployed. Thanks for your patience while we get this sorted.

New active DC project: RSA factoring challenge 576

J

Jani

Senior member
  • Currently beta phase
  • Only Windows version at this point

Team "Team Anandtech" already created, 2 workunit done (hopefully stats are updated soon) 😀 WU took about 10 minutes with my Tbird 1200.

The NEO Project
 
I see its another mathmatical challenge ,what I don't get is where the £ comes from for NEO?😕

Good to hear there's a TA created🙂
 
Oh, boy. I looked at this guy's algorithm (if you can even call it that.) If my calculations are correct it will
require 2^287 divisions, or about 2.5*10^86 divisions to find the factor this way. Remember, we just completed a project with somewhere on the order of 2^64 operations. This will take on the order of 10^67 times as long, or at least 5*10^67 years! :Q Even Pollard Rho would take only about 2^144 divisions, on average. And we have seen distributed Pollard Rho before. The chances this approach will be successful are infinitesimal.

I think I'll e-mail him and tell him about distributed Pollard Rho.
 
You must log in or register to reply here.

TRENDING THREADS

Back
Top