Paket: libecm1-dev (7.0.5+ds-1)

[ Källkod: gmp-ecm  ]

factor integers using the Elliptic Curve Method -- libdev

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 static library and symbolic links needed for development.

Märken: Software Development: Bibliotek, Role: Development Library

Andra paket besläktade med libecm1-dev

• dep: libecm1 (= 7.0.5+ds-1)

  factor integers using the Elliptic Curve Method -- lib

• dep: libecm1-dev-common (= 7.0.5+ds-1)

  factor integers using the Elliptic Curve Method -- header

• dep: libgmp-dev

  Multiprecision arithmetic library developers tools

Hämta libecm1-dev

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
amd64	372,7 kbyte	1.049,0 kbyte	[filförteckning]
arm64	358,0 kbyte	967,0 kbyte	[filförteckning]
armel	344,5 kbyte	797,0 kbyte	[filförteckning]
armhf	345,6 kbyte	710,0 kbyte	[filförteckning]
i386	384,0 kbyte	926,0 kbyte	[filförteckning]
mips64el	382,9 kbyte	1.237,0 kbyte	[filförteckning]
mipsel	384,1 kbyte	959,0 kbyte	[filförteckning]
ppc64el	388,9 kbyte	1.118,0 kbyte	[filförteckning]
s390x	358,4 kbyte	1.000,0 kbyte	[filförteckning]