Paket: libecm1 (7.0.4+ds-5)

[ Källkod: gmp-ecm  ]

factor integers using the Elliptic Curve Method -- lib

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 shared library.

Märken: Role: Shared Library

Andra paket besläktade med libecm1

• dep: libc6 (>= 2.14) [amd64]

  GNU C-bibliotek: Delade bibliotek
  också ett virtuellt paket som tillhandahålls av libc6-udeb

  dep: libc6 (>= 2.17) [arm64, ppc64el]

  dep: libc6 (>= 2.4) [ej amd64, arm64, ppc64el]

• dep: libgmp10 (>= 2:6.1)

  Multiprecision arithmetic library

Hämta libecm1

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
amd64	316,0 kbyte	675,0 kbyte	[filförteckning]
arm64	297,3 kbyte	615,0 kbyte	[filförteckning]
armel	288,0 kbyte	594,0 kbyte	[filförteckning]
armhf	289,2 kbyte	518,0 kbyte	[filförteckning]
i386	321,9 kbyte	698,0 kbyte	[filförteckning]
mips64el	294,6 kbyte	654,0 kbyte	[filförteckning]
mipsel	299,2 kbyte	664,0 kbyte	[filförteckning]
ppc64el	321,4 kbyte	739,0 kbyte	[filförteckning]
s390x	299,8 kbyte	655,0 kbyte	[filförteckning]