How to Install and Uninstall libecm1-dev Package on Kali Linux
Last updated: November 22,2024
1. Install "libecm1-dev" package
Please follow the guidelines below to install libecm1-dev on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libecm1-dev
Copied
2. Uninstall "libecm1-dev" package
Please follow the guidance below to uninstall libecm1-dev on Kali Linux:
$
sudo apt remove
libecm1-dev
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libecm1-dev package on Kali Linux
Package: libecm1-dev
Source: gmp-ecm (7.0.5+ds-1)
Version: 7.0.5+ds-1+b1
Installed-Size: 1058
Maintainer: Debian Math Team
Architecture: amd64
Replaces: libecm0-dev
Depends: libecm1 (= 7.0.5+ds-1+b1), libecm1-dev-common (= 7.0.5+ds-1), libgmp-dev
Breaks: libecm0-dev
Size: 381488
SHA256: 99ae88703958c2762cad84ce16a7801c595c76dbf8191a23e80542741c73fb09
SHA1: 3b7d7fe211bec44e5893ca343061e9f0a4aac8b9
MD5sum: acc1b965f80d227da4e693a72e9ebaf7
Description: 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.
Description-md5:
Multi-Arch: same
Homepage: https://gitlab.inria.fr/zimmerma/ecm
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/g/gmp-ecm/libecm1-dev_7.0.5+ds-1+b1_amd64.deb
Source: gmp-ecm (7.0.5+ds-1)
Version: 7.0.5+ds-1+b1
Installed-Size: 1058
Maintainer: Debian Math Team
Architecture: amd64
Replaces: libecm0-dev
Depends: libecm1 (= 7.0.5+ds-1+b1), libecm1-dev-common (= 7.0.5+ds-1), libgmp-dev
Breaks: libecm0-dev
Size: 381488
SHA256: 99ae88703958c2762cad84ce16a7801c595c76dbf8191a23e80542741c73fb09
SHA1: 3b7d7fe211bec44e5893ca343061e9f0a4aac8b9
MD5sum: acc1b965f80d227da4e693a72e9ebaf7
Description: 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.
Description-md5:
Multi-Arch: same
Homepage: https://gitlab.inria.fr/zimmerma/ecm
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/g/gmp-ecm/libecm1-dev_7.0.5+ds-1+b1_amd64.deb