Ubuntu
gmp-ecm package

gmp-ecm 7.0.5+ds-1build1 source package in Ubuntu

Changelog

gmp-ecm (7.0.5+ds-1build1) noble; urgency=high

  * No change rebuild against frame pointers and time_t.

 -- Julian Andres Klode <email address hidden>  Mon, 22 Apr 2024 11:42:35 +0200

Upload details

Uploaded by:
Julian Andres Klode
Uploaded to:
Noble
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
math
Urgency:
Very Urgent

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release universe math
Noble release universe math

Downloads

File Size SHA-256 Checksum
gmp-ecm_7.0.5+ds.orig.tar.xz 606.7 KiB b6ae603063937a6b09c34892d2240eafe7597a77936b9b5729d76b781bcd91a7
gmp-ecm_7.0.5+ds-1build1.debian.tar.xz 11.5 KiB d4de82008de674dabe9a28635d2656d975c97c816c74b5c8e25771827b5dd058
gmp-ecm_7.0.5+ds-1build1.dsc 2.3 KiB c3ba97e387c94d5d267bfa42beba47f7178b3568463289a8885fc14d5dd47dc9

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.
 .
 This package provides the command line utility.

gmp-ecm-dbgsym: debug symbols for gmp-ecm
libecm-dev: dummy package

 This is a dummy package.

libecm1: factor integers using the Elliptic Curve Method -- lib

 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.

libecm1-dbgsym: debug symbols for libecm1
libecm1-dev: factor integers using the Elliptic Curve Method -- libdev

 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 and symbolic links needed
 for development.

libecm1-dev-common: factor integers using the Elliptic Curve Method -- header

 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 header needed by developers.