gmp-ecm 6.4.4-1 source package in Ubuntu
Changelog
gmp-ecm (6.4.4-1) unstable; urgency=low
* New upstream release.
+ Fixes build with latest GMP (closes: #713399).
-- Laurent Fousse <email address hidden> Sat, 13 Jul 2013 22:33:00 -0700
Upload details
- Uploaded by:
- Laurent Fousse
- Uploaded to:
- Sid
- Original maintainer:
- Laurent Fousse
- Architectures:
- any
- Section:
- math
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| gmp-ecm_6.4.4-1.dsc | 1.2 KiB | 4d3c0487c75b9092cab6f4693300530b0bea21065f3cd71f952ee0d85ea2a56b |
| gmp-ecm_6.4.4.orig.tar.gz | 919.0 KiB | c813a814592d8092745012debdba25388211e1a2579c26183adda7cfa215b06c |
| gmp-ecm_6.4.4-1.debian.tar.gz | 4.7 KiB | 23ebcfdfe94aed0071142b28f75faba02a7099f65a0e5636c6eb0284ea3759d9 |
Available diffs
- diff from 6.4.2-2 to 6.4.4-1 (57.9 KiB)
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.
- libecm-dev: Factor integers using the Elliptic Curve Method (library)
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.
- libecm0: Factor integers using the Elliptic Curve Method (library)
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.
