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

[ Source: gmp-ecm  ]

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.

Tags: Field: Mathematics, User Interface: Command Line, Role: role::program, scope::utility

Other Packages Related to gmp-ecm

• dep: libc6 (>= 2.17) [arm64]

  GNU Biblioteca C: Bibliotecas compartilhadas
  also a virtual package provided by libc6-udeb

  dep: libc6 (>= 2.7) [not arm64]

• dep: libecm1

  factor integers using the Elliptic Curve Method -- lib

• dep: libgmp10 (>= 2:6.1)

  biblioteca aritmética de multi precisão

Download gmp-ecm

Download for all available architectures

Architecture	Package Size	Installed Size	Files
amd64	236.9 kB	431.0 kB	[list of files]
arm64	234.1 kB	423.0 kB	[list of files]
armhf	234.1 kB	406.0 kB	[list of files]
i386	239.2 kB	434.0 kB	[list of files]