gmp-ecm 6.3-7 source package in Ubuntu


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

  * Fix dependencies on libgmp-dev (closes: #617207).

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

  * Update build-depends to libgmp-dev (closes: #617207).
  * Modify my email address.
 -- Paolo Sammicheli <email address hidden>   Wed,  22 Jun 2011 11:37:17 +0000

Upload details

Uploaded by:
Paolo Sammicheli on 2011-06-22
Uploaded to:
Original maintainer:
Laurent Fousse
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section


File Size SHA-256 Checksum
gmp-ecm_6.3.orig.tar.gz 788.7 KiB b9d6f743d9d303a3a4c91f4564f493f29f3d551b7c5065c385c259f3673f4924
gmp-ecm_6.3-7.debian.tar.gz 7.1 KiB 2158c8c2b59b3952d3dc524139c591b1e7d308f03659a2d5b19c9134044b5301
gmp-ecm_6.3-7.dsc 1.1 KiB 90c9cbcb316369d07c10e0a380d3e3f37b82a72c16ecbd76588aa7faba1379c1

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 for more
 information about ecmnet.

libecm-dev: No summary available for libecm-dev in ubuntu oneiric.

No description available for libecm-dev in ubuntu oneiric.

libecm0: No summary available for libecm0 in ubuntu oneiric.

No description available for libecm0 in ubuntu oneiric.