Probable Solution Found for ECC2-109 Challenge

kpearson writes "The eCompute ECC2-109 distributed computing project discovered a probable solution to Certicom's ECC2-109 challenge today. The challenge was to defeat a 109-bit Elliptic Curve Cryptosystem (ECC). Since the eCompute ECC2-109 project began on November 8, 2002, 1,981 volunteers have run the project's software and found almost 40.5 million distinguished points. From those points the project found two which matched and caused a collision, enabling the project to find a solution to the ECC. The solution was submitted to Certicom this morning for verification."

Comments

This reminds me of a Bob Newhart sketch

[Anonymous Coward]

If you put enough computers on the problem, you will eventually find a solution by random chance. (correct me if I'm wrong.)

The sketch goes something like this:

If you put enough monkeys at enough typewriters, they will eventually, by random chance, type all the works of Shakespeare. Unfortunately, this would require an infinite number of people going around checking the monkey typing.

"Bob, Bob, come here, I think we've got something! Yes this is really it! 'To be, or not to be, that is the gzortmanplatz...'"

curves...

[dj245]

Ooh, Curves! Can I touch?

I am too dumb to say anything further on the subject.

Re:Really hard to understand for someone

[dj245]

The NSA is the largest hirer of math majors.

Gee and I thought the cell phone companies hired the most math majors.

Seriously, you have to have taken Analytical Calculus I-III, Differential Equations, Geophysical Fluid Dynamics, and be Phd standing in order to understand the rate plans. Think of the guy who must have made them up!