Paket: libecm1-dev (7.0.4+ds-5)

[ Kaynak: 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.

Etiketler: Yazılım Geliştirme: Kitaplıklar, Rol: Geliştirme Kitaplığı

libecm1-dev ile İlgili Diğer Paketler

• dep: libecm1 (= 7.0.4+ds-5)

  factor integers using the Elliptic Curve Method -- lib

• dep: libecm1-dev-common (= 7.0.4+ds-5)

  factor integers using the Elliptic Curve Method -- header

• dep: libgmp-dev

  Multiprecision arithmetic library developers tools

libecm1-dev indir

Tüm mevcut mimariler için indir

Mimari	Paket Boyutu	Kurulu Boyut	Dosyalar
amd64	343,9 kB	953,0 kB	[dosya listesi]
arm64	329,4 kB	869,0 kB	[dosya listesi]
armel	315,6 kB	728,0 kB	[dosya listesi]
armhf	316,0 kB	648,0 kB	[dosya listesi]
i386	350,4 kB	835,0 kB	[dosya listesi]
mips64el	350,0 kB	1.094,0 kB	[dosya listesi]
mipsel	350,0 kB	863,0 kB	[dosya listesi]
ppc64el	354,0 kB	990,0 kB	[dosya listesi]
s390x	328,0 kB	894,0 kB	[dosya listesi]