Ubuntu
gmp-ecm package

gmp-ecm 6.3-10ubuntu1 source package in Ubuntu

Changelog

gmp-ecm (6.3-10ubuntu1) precise; urgency=low

  * debian/patches/0004-Fix-SSE2-support.patch:
    - Grab patch from upstream SVN to fix compilation on i386 with SSE2.
      Fixes FTBFS.
 -- Michael Terry <email address hidden>   Wed, 30 Nov 2011 13:41:51 -0500

Upload details

Uploaded by:
Michael Terry
Uploaded to:
Precise
Original maintainer:
Ubuntu Developers
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-10ubuntu1.debian.tar.gz 69.9 KiB 6eca606a6071e46733dea7c0b469941305fa3e55d24598bcd870ebbb8b1cb162
gmp-ecm_6.3-10ubuntu1.dsc 1.2 KiB 11ea5450bc4279d75650655d511bb0bdf1a3dcbceb3a3ae6d7e9a2b59abc475b

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.