 |
|
|
|
|
|
|
|
|
|
|
 |
 |
 |
 |
|
||||||
 |
|
|||||||||
 |
|
|||||||||
 |
|
|||||||||
 |
 |
 |
 |
 |
 |
 |
 |
 |
|
|
 |
|
|
 |
|
|
| |
||
| |
||
 |
|
|
 |
|
|
|
School of Computing
contributing to global The Certicom ECC Challenge has been developed to encourage and stimulate further research in the security analysis of elliptic curve cryptosystems. An attempt to crack the problem has been started by INRIA, France and DCU is helping in this. From the web pages ... "We need to find distinguished points on a certain elliptic curve until the same point is found in two different ways and then the solution can be computed easily. Each point takes 1.4 billion elliptic curve operations on average and it is estimated that a matching pair will be found after about 1.3 million points." Over the Christmas period, 92 PIII 450 MHz PCs will be churning away contributing to this effort. You can see exactly how much we have computed Here is an e-mail from Robert Harley with an update of how things are coming along |