gmp-ecm 6.4.4+ds-5 source package in Ubuntu
Changelog
gmp-ecm (6.4.4+ds-5) unstable; urgency=medium
* FTBFS bug fix release (Closes: #806619):
* Debianization:
- arch/indep build scheme, introduce.
-- Jerome Benoit <email address hidden> Mon, 30 Nov 2015 21:31:59 +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 | |
|---|---|---|---|---|
| Xenial | release | universe | math |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| gmp-ecm_6.4.4+ds-5.dsc | 2.3 KiB | 9d33d1ef35ac62c581660c34d2e7ac897a612ce6f309f8fbcc856c79d65b3235 |
| gmp-ecm_6.4.4+ds.orig.tar.gz | 563.3 KiB | 897764e39e0994951f502cdbbd78728a37b1731e5674abb495fa884c107fc016 |
| gmp-ecm_6.4.4+ds-5.debian.tar.xz | 17.9 KiB | 36e8f46523651ac62eff7ad2d470b7dcd614aa09fcae7098b936d830d366d99d |
Available diffs
- diff from 6.4.4+ds-4 to 6.4.4+ds-5 (837 bytes)
No changes file available.
Binary packages built by this source
- gmp-ecm: No summary available for gmp-ecm in ubuntu yakkety.
No description available for gmp-ecm in ubuntu yakkety.
- gmp-ecm-dbgsym: debug symbols for package gmp-ecm
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.
- libecm-dev: transitional dummy package
This is a transitional dummy package. It can safely be removed.
- libecm0: 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.
- libecm0-dbg: No summary available for libecm0-dbg in ubuntu yakkety.
No description available for libecm0-dbg in ubuntu yakkety.
- libecm0-dbgsym: debug symbols for package libecm0
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.
- libecm0-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.
- libecm0-dev-common: No summary available for libecm0-dev-common in ubuntu yakkety.
No description available for libecm0-dev-common in ubuntu yakkety.
