| ECC2-97 INFO | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
The UNB Crytography Group and Entrust Technologies Inc. helped in the international effort to crack the ECC-2 97bit Elliptic Curve encryption algorithm. Using a large number of computers working together in a distributed computing system, and using a "birthday paradox" algorithm iterating from random initial points (distributed over all machines) with a pseudo-random function. |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ECC2-97 RESULTS | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
The solution to Certicom's ECCp-97 problem is the residue class of 64206457470187038759216338447 modulo 79228162514264464603828067969. The calculation was carried out in 40 days by a group of 195 people and 740 machines in more than 20 countries. It was found after 127,492 Distinguished Points. At an expected 2^30 iterations per Point, the ECC2-97 coordinators estimated it took 119 trillion (119 E12) iterations. The entire effort took about 16,000 MIPS/years. A collision was detected at 13:00 GMT on Tuesday 21st of September 1999. The two Points were coincidentally both found by Paul Bourke from Astrophysics Supercomputing (Australia) on two different Alpha CPUs. This effort was organised by Robert Harley at INRIA. |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| TEAM ENTRUST/UNB STATISTICS | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Entrust Technologies
|
| ECC2-97 STATISTICS | ||||||||||||||||||||||||||||||||||||||||||
Top 20 teams:
|
Return to Distributed Computing Projects Home
Page