Package: libecm0 (6.2-1)

[ Source: gmp-ecm  ]

Factor integers using the Elliptic Curve Method (library)

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.

This package provides the shared library.

Tags: Role: Shared Library

Other Packages Related to libecm0

• 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: libgmp3c2

  Multiprecision arithmetic library

Download libecm0

Download for all available architectures

Architecture	Package Size	Installed Size	Files
alpha	199.1 kB	464.0 kB	[list of files]
amd64	184.1 kB	420.0 kB	[list of files]
arm	173.0 kB	364.0 kB	[list of files]
armel	177.2 kB	376.0 kB	[list of files]
hppa	202.0 kB	456.0 kB	[list of files]
i386	180.7 kB	352.0 kB	[list of files]
ia64	242.6 kB	652.0 kB	[list of files]
mips	184.8 kB	448.0 kB	[list of files]
mipsel	185.6 kB	448.0 kB	[list of files]
powerpc	193.3 kB	428.0 kB	[list of files]
s390	194.9 kB	428.0 kB	[list of files]
sparc	174.4 kB	384.0 kB	[list of files]