| Paketname | gmp-ecm |
| Beschreibung | Factor integers using the Elliptic Curve Method |
| Archiv/Repository | Offizielles Debian Archiv squeeze (main) |
| Version | 6.3-4 |
| Sektion | math |
| Priorität | optional |
| Installierte Größe | 196 Byte |
| Hängt ab von | libc6 (>= 2.7), libecm0, libgmp3c2 |
| Empfohlene Pakete | |
| Paketbetreuer | Laurent Fousse |
| Quelle | |
| Paketgröße | 115932 Byte |
| Prüfsumme MD5 | f1d016c43bee0bca862d9345fed2b704 |
| Prüfsumme SHA1 | f8b4c083adaab12b473cee3ad6bf07a7dae5fa62 |
| Prüfsumme SHA256 | 99a41c7020922e76b4bca15d47087a0d26894f232cd301d7019878487aa403f1 |
| Link zum Herunterladen | gmp-ecm_6.3-4_i386.deb |
| Ausführliche Beschreibung | 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.
|