Ubuntu
gmp-ecm package

gmp-ecm 7.0.4+ds-6 source package in Ubuntu

Changelog

gmp-ecm (7.0.4+ds-6) unstable; urgency=medium

  * Debianization:
    - d/control:
      - Homepage field, update;
      - debhelper, migrate to version 13 (discar d/compat);
      - Rules-Requires-Root, introduce and set to no;
      - Standards-Version, bump to version 4.6.0 (no change);
    - d/rules:
      - override_dh_missing target, provide;
    - d/copyright:
      - Upstream-Contact field, refresh;
      - Source field, update;
      - copyright year tuples, update;
    - d/patches:
      - d/p/upstream-fix-manpage-acute_accent.patch, introduce;
      - d/p/upstream-national_encoding.patch, introduce;
      - d/p/debianization-examples.patch, provide Forwarded field;
    - d/libecm1.lintian-overrides:
      - exit-in-shared-library tag, rename from shlib-calls-exit;
    - d/tests:
      - d/t/{build-examples,make-longcheck}, now use AUTOPKGTEST_TMP;
    - d/watch, migration to gitlab.inria.fr.

 -- Jerome Benoit <email address hidden>  Thu, 14 Oct 2021 13:33: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 Pocket Published Component Section
Jammy release universe math

Downloads

File Size SHA-256 Checksum
gmp-ecm_7.0.4+ds-6.dsc 2.9 KiB 7cf351fc0b76924a6a741a6181d37f4715179c69f760f05653dfa27c57340ae7
gmp-ecm_7.0.4+ds.orig.tar.xz 490.9 KiB 303e2ff57942265e4f562346ef75ccfff12f1fb4ec04470998aa54ddee517216
gmp-ecm_7.0.4+ds-6.debian.tar.xz 11.8 KiB c923269aa7e2c2388eaaffab2332ac0fad637faad09d0f94279b882c4ca8abf1

Available diffs

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: No summary available for gmp-ecm-dbgsym in ubuntu kinetic.

No description available for gmp-ecm-dbgsym in ubuntu kinetic.

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.