Debian packages on transit

Package: libecm1-dev-common
Status: install ok installed
Priority: optional
Section: libdevel
Installed-Size: 162
Maintainer: Debian Math Team <team+math@tracker.debian.org> [Debian Bug Report]
Architecture: all
Multi-Arch: foreign
Source: gmp-ecm
Version: 7.0.5+ds-1
Replaces: libecm-dev (<= 6.4.4-2), libecm0-dev-common
Recommends: libecm1-dev (= 7.0.5+ds-1)
Breaks: libecm-dev (<= 6.4.4-2), libecm0-dev-common
Description: 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.
Homepage: https://gitlab.inria.fr/zimmerma/ecm

Files owned by package libecm1-dev-common:

/usr
/usr/include
/usr/include/ecm.h
/usr/share
/usr/share/doc
/usr/share/doc/libecm1-dev-common
/usr/share/doc/libecm1-dev-common/changelog.Debian.gz
/usr/share/doc/libecm1-dev-common/changelog.gz
/usr/share/doc/libecm1-dev-common/copyright