# gmp-ecm

## Factor integers using the Elliptic Curve Method

Description

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. See http://www.loria.fr/~zimmerma/records/ecmnet.html for more information about ecmnet. This package provides the command line utility.Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.

Upload a screenshot*Hint: upload an image here from your clipboard with Ctrl-V*

Homepage

https://gitlab.inria.fr/zimmerma/ecm

Install this software package

If the package is available for the distribution you are currently using on your computer then install the software by clicking onâ€¦

Install gmp-ecm