gmp-ecm 7.0.5+ds-2 source package in Ubuntu
Changelog
gmp-ecm (7.0.5+ds-2) unstable; urgency=medium
* Debianization:
- d/watch, correct;
- d/control:
- Standards-Version, bump to version 4.7.0 (no change);
- d/copyright:
- copyright year-tuples, update;
- d/source/*:
- d/s/lintian-overrides, refresh.
-- Jerome Benoit <email address hidden> Sat, 18 May 2024 11:48:44 +0000
Upload details
- Uploaded by:
- Debian Math Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Math Team
- Architectures:
- any all
- Section:
- math
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| gmp-ecm_7.0.5+ds-2.dsc | 2.9 KiB | 7d2eca2c9cee5a2625b756ea6e94b1169a6dc74ea5cc793fa127ab0740999cdb |
| gmp-ecm_7.0.5+ds.orig.tar.xz | 606.7 KiB | b6ae603063937a6b09c34892d2240eafe7597a77936b9b5729d76b781bcd91a7 |
| gmp-ecm_7.0.5+ds-2.debian.tar.xz | 11.4 KiB | d4dbbccbe9a957a84bb4d1d0320085939e79b641b9e04e13626462b8a2971509 |
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: debug symbols for gmp-ecm
- libecm-dev: dummy package
This is a dummy package.
- 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: debug symbols for libecm1
- 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: factor integers using the Elliptic Curve Method -- header
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 header needed by developers.
