Ubuntu
gmp-ecm package

gmp-ecm 6.3-10 source package in Ubuntu

Changelog

gmp-ecm (6.3-10) unstable; urgency=low

  * Use the same compiler on all archs.

gmp-ecm (6.3-9) unstable; urgency=low

  * Don't build-depend on non-existent packages.

gmp-ecm (6.3-8) unstable; urgency=low

  * Properly convert to quilt format (closes: #643134).
  * Upgrade dependency on debhelper.
 -- Ubuntu Archive Auto-Sync <email address hidden>   Mon,  17 Oct 2011 10:55:22 +0000

Upload details

Uploaded by:
Ubuntu Archive Auto-Sync
Uploaded to:
Precise
Original maintainer:
Laurent Fousse
Architectures:
any
Section:
math
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
gmp-ecm_6.3.orig.tar.gz 788.7 KiB b9d6f743d9d303a3a4c91f4564f493f29f3d551b7c5065c385c259f3673f4924
gmp-ecm_6.3-10.debian.tar.gz 69.2 KiB 419dc2c8d519d5338705612f2141cc2d360ee3e5c6079a47997442a9384d0006
gmp-ecm_6.3-10.dsc 1.1 KiB 73e109bbbd7a58efe84bb5089c55490bcd8158588d3a9b0f71bc9e8a4a086309

Available diffs

View changes file

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.