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. Just grab the code and leave it running in the background. The program uses CPU time but almost no other resources, so you'll hardly notice it. Rob, Damien, Daniel and Xavier.
Constructive comments are very welcome.
Submit batches of points manually using this handy form . Read the slightly technical FAQ about ECDLs. MacOS port , now with speedy Altivec code by Dan Oetting. We got the matching points. Some people may have points that were not sent.