gmp-ecm 7.0.4+ds-5 source package in Ubuntu
Changelog
gmp-ecm (7.0.4+ds-5) unstable; urgency=medium
* Serious Bug fix release (Closes: #905191), correct typo in extension;
thanks to Andreas Beckmann <email address hidden> for spotting it.
-- Jerome Benoit <email address hidden> Sun, 28 Oct 2018 00:31:09 +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 | Published | Component | Section | |
|---|---|---|---|---|
| Focal | release | universe | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| gmp-ecm_7.0.4+ds-5.dsc | 2.9 KiB | 2aebe1bab2e9e3ed2538fe68922c078b3cc8ffd2cc26e2d69111a3d84d224dd5 |
| gmp-ecm_7.0.4+ds.orig.tar.xz | 490.9 KiB | 303e2ff57942265e4f562346ef75ccfff12f1fb4ec04470998aa54ddee517216 |
| gmp-ecm_7.0.4+ds-5.debian.tar.xz | 10.5 KiB | ea1cc72e90dc89996de76ba3a90f6a30cc6b4dc4ceb0d8b7afe3590e75ae63a3 |
Available diffs
- diff from 7.0.4+ds-3 to 7.0.4+ds-5 (784 bytes)
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 hirsute.
No description available for gmp-ecm-dbgsym in ubuntu hirsute.
- libecm-dev: No summary available for libecm-dev in ubuntu impish.
No description available for libecm-dev in ubuntu impish.
- libecm1: factor integers using the Elliptic Curve Method -- lib
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 shared library.
- libecm1-dbgsym: No summary available for libecm1-dbgsym in ubuntu eoan.
No description available for libecm1-dbgsym in ubuntu eoan.
- libecm1-dev: No summary available for libecm1-dev in ubuntu eoan.
No description available for libecm1-dev in ubuntu eoan.
- libecm1-dev-common: No summary available for libecm1-dev-common in ubuntu eoan.
No description available for libecm1-dev-common in ubuntu eoan.
