Skip to content
Sections
>> Trisquel >> Packages >> nabia >> math >> gmp-ecm
etiona  ] [  nabia  ] [  aramo  ]
[ Source: gmp-ecm  ]

Package: gmp-ecm (7.0.4+ds-5)

Factor integers using the Elliptic Curve Method

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.

Other Packages Related to gmp-ecm

  • depends
  • recommends
  • suggests
  • dep: libc6 (>= 2.28) [armhf]
    GNU C Library: Shared libraries
    also a virtual package provided by libc6-udeb
    dep: libc6 (>= 2.7) [amd64]
  • dep: libecm1
    factor integers using the Elliptic Curve Method -- lib
  • dep: libgmp10 (>= 2:6.1)
    Multiprecision arithmetic library

Download gmp-ecm

Download for all available architectures
Architecture Package Size Installed Size Files
amd64 105.5 kB311 kB [list of files]
armhf 102.9 kB286 kB [list of files]