Ubuntu
gmp-ecm package

gmp-ecm 7.0.4+ds-1 source package in Ubuntu

Changelog

gmp-ecm (7.0.4+ds-1) unstable; urgency=medium

  * New upstream patch release.

 -- Jerome Benoit <email address hidden>  Fri, 14 Oct 2016 00:25:48 +0000

Upload details

Uploaded by:
Debian Science Team
Uploaded to:
Sid
Original maintainer:
Debian Science Team
Architectures:
any all
Section:
math
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Bionic release universe math

Downloads

File Size SHA-256 Checksum
gmp-ecm_7.0.4+ds-1.dsc 2.9 KiB 0d3709a465b46b303ae2acec40b0a615fa1df14bb549f4dc099fc1b7427ab136
gmp-ecm_7.0.4+ds.orig.tar.xz 490.9 KiB 303e2ff57942265e4f562346ef75ccfff12f1fb4ec04470998aa54ddee517216
gmp-ecm_7.0.4+ds-1.debian.tar.xz 10.3 KiB a3637f4580bee7c51b60dd67969d78296387d16400bd5c6010d9a249cf8a3678

Available diffs

No changes file available.

Binary packages built by this source

gmp-ecm: Factor integers using the Elliptic Curve Method

 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 command line utility.

gmp-ecm-dbgsym: No summary available for gmp-ecm-dbgsym in ubuntu cosmic.

No description available for gmp-ecm-dbgsym in ubuntu cosmic.

libecm-dev: No summary available for libecm-dev in ubuntu cosmic.

No description available for libecm-dev in ubuntu cosmic.

libecm1: No summary available for libecm1 in ubuntu artful.

No description available for libecm1 in ubuntu artful.

libecm1-dbgsym: No summary available for libecm1-dbgsym in ubuntu zesty.

No description available for libecm1-dbgsym in ubuntu zesty.

libecm1-dev: 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-common: No summary available for libecm1-dev-common in ubuntu cosmic.

No description available for libecm1-dev-common in ubuntu cosmic.