gmp-ecm is a free implementation of the Elliptic Curve Method (ECM)
for integer factorization.

The original purpose of the ECMNET project was to make Richard Brent's
prediction true, i.e. to find a factor of 50 digits or more by
ECM. This goal was attained on September 14, 1998, when Conrad Curry
found a 53-digit factor of 2^677-1 c150 using George Woltman's mprime
program. The new goal of ECMNET is now to find other large factors by
ecm, mainly by contributing to the Cunningham project, most likely the
longest, ongoing computational project in history according to Bob
Silverman. A new record was set by Nik Lygeros and Michel Mizony, who
found in December 1999 a prime factor of 54 digits using GMP-ECM.

/usr/share/doc/gmp-ecm/README.Debian

The ECMNET Project
------------------
Several number factorization projects could use your help. Since
composite numbers lists can become obsolete quickly, they are not
included in the package but you can have a look at upstream's page to
get you started:
http://www.loria.fr/~zimmerma/records/ecmnet.html
-- Laurent Fousse <laurent@komite.net>, Mon, 28 Feb 2005 16:34:07 +0100

/usr/share/doc/gmp-ecm/README.gz

This is the README file for GMP-ECM. (See INSTALL-ecm for installing GMP-ECM
and the ecm library, and README.lib for using the ecm library.)
Table of contents of this file:
1. Basic usage.
2. How to use P-1, P+1, and ECM efficiently?
3. Extra factors and Brent-Suyama's extension.
4. Memory usage.
5. Expression syntax reference for GMP-ECM's syntax parser.
6. Options -save, -resume and -chkpnt.
7.
more»

/usr/share/doc/gmp-ecm/NEWS.gz

Changes between ecm-6.4.1 and ecm-6.4.2:
* Corrected the copyright headers
* Reduced memory usage in stage 1 with -batch={1,2} mode.
* Fixed bug in modular reduction (could occur only for numbers larger than
386 digits on 64-bit computers and 193 digits on 32-bit computers).
* Speedup in stage 2 with the NTT default mode
Changes between ecm-6.4 and ecm-6.4.1:
* GMP-ECM is now distributed under
more»