gmp-ecm 6.4.4+ds-2 source package in Ubuntu
Changelog
gmp-ecm (6.4.4+ds-2) unstable; urgency=medium * RC bug fix release (Closes: 792549), stabilize libdev transition. -- Jerome Benoit <email address hidden> Thu, 16 Jul 2015 16:07:37 +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 |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| gmp-ecm_6.4.4+ds-2.dsc | 2.3 KiB | 0d378aab7cbf347c913412ecfaddda97eef92331e479a05fa0da4b13a7c09b25 |
| gmp-ecm_6.4.4+ds.orig.tar.gz | 563.3 KiB | 897764e39e0994951f502cdbbd78728a37b1731e5674abb495fa884c107fc016 |
| gmp-ecm_6.4.4+ds-2.debian.tar.xz | 16.8 KiB | c6f80622b53746c8ce048697a50c3d8db574d7e1a7103ea2b692d85726c63c01 |
Available diffs
- diff from 6.4.4+ds-1 to 6.4.4+ds-2 (1016 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: 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: No summary available for libecm-dev in ubuntu wily.
No description available for libecm-dev in ubuntu wily.
- libecm0: No summary available for libecm0 in ubuntu wily.
No description available for libecm0 in ubuntu wily.
- libecm0-dbg: No summary available for libecm0-dbg in ubuntu wily.
No description available for libecm0-dbg in ubuntu wily.
- libecm0-dbgsym: No summary available for libecm0-dbgsym in ubuntu wily.
No description available for libecm0-dbgsym in ubuntu wily.
- libecm0-dev: No summary available for libecm0-dev in ubuntu wily.
No description available for libecm0-dev in ubuntu wily.
- libecm0-dev-common: No summary available for libecm0-dev-common in ubuntu wily.
No description available for libecm0-dev-common in ubuntu wily.
