Package: gmp-ecm (6.2-1)

[ 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 informations about ecmnet.

Tags: Field: Mathematics, User Interface: Command Line, Role: Program, Scope: Utility

Other Packages Related to gmp-ecm

• dep: libc6 (>= 2.7-1) [not alpha, ia64]

  GNU C Library: Shared libraries
  also a virtual package provided by libc6-udeb

• dep: libc6.1 (>= 2.7-1) [alpha, ia64]

  GNU C Library: Shared libraries
  also a virtual package provided by libc6.1-udeb

• dep: libecm0

  Factor integers using the Elliptic Curve Method (library)

• dep: libgmp3c2

  Biblioteca aritmética de multi-precisão

Download gmp-ecm

Download for all available architectures

Architecture	Package Size	Installed Size	Files
alpha	102.1 kB	204.0 kB	[list of files]
amd64	100.0 kB	192.0 kB	[list of files]
arm	97.1 kB	180.0 kB	[list of files]
armel	100.6 kB	184.0 kB	[list of files]
hppa	100.7 kB	184.0 kB	[list of files]
i386	97.5 kB	140.0 kB	[list of files]
ia64	111.0 kB	240.0 kB	[list of files]
mips	99.9 kB	196.0 kB	[list of files]
mipsel	99.0 kB	196.0 kB	[list of files]
powerpc	102.4 kB	196.0 kB	[list of files]
s390	98.9 kB	184.0 kB	[list of files]
sparc	98.2 kB	184.0 kB	[list of files]