套件：libecm1-dev（7.0.5+ds-1）

[ 原始碼： 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.

標籤: 軟體開發: 函式庫, 角色: 開發用函式庫

其他與 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

下載 libecm1-dev

下載可用於所有硬體架構的

硬體架構	套件大小	安裝後大小	檔案
amd64	372。7 kB	1，049。0 kB	[檔案列表]
arm64	358。0 kB	967。0 kB	[檔案列表]
armel	344。5 kB	797。0 kB	[檔案列表]
armhf	345。6 kB	710。0 kB	[檔案列表]
i386	384。0 kB	926。0 kB	[檔案列表]
mips64el	382。9 kB	1，237。0 kB	[檔案列表]
mipsel	384。1 kB	959。0 kB	[檔案列表]
ppc64el	388。9 kB	1，118。0 kB	[檔案列表]
s390x	358。4 kB	1，000。0 kB	[檔案列表]