软件包：libecm1-dev（7.0.6+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.6+ds-1)

  factor integers using the Elliptic Curve Method -- lib

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

  factor integers using the Elliptic Curve Method -- header

• dep: libgmp-dev

  Multiprecision arithmetic library developers tools

下载 libecm1-dev

下载可用于所有硬件架构的

硬件架构	软件包大小	安装后大小	文件
amd64	243.1 kB	940.0 kB	[文件列表]
arm64	225.5 kB	857.0 kB	[文件列表]
armel	213.5 kB	679.0 kB	[文件列表]
armhf	213.1 kB	584.0 kB	[文件列表]
i386	253.8 kB	809.0 kB	[文件列表]
mips64el	251.4 kB	1,132.0 kB	[文件列表]
ppc64el	256.3 kB	1,002.0 kB	[文件列表]
riscv64	444.5 kB	3,474.0 kB	[文件列表]
s390x	246.4 kB	972.0 kB	[文件列表]