Пакет: gmp-ecm (6.1.2-1) [universe]
Ссылки для gmp-ecm
Ресурсы Ubuntu:
Загрузка пакета исходного кода gmp-ecm:
Сопровождающий:
Please consider filing a bug or asking a question via Launchpad before contacting the maintainer directly.
Original Maintainer (usually from Debian):
- Laurent Fousse
It should generally not be necessary for users to contact the original maintainer.
Подобные пакеты:
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 informations about ecmnet.
Другие пакеты, относящиеся к gmp-ecm
|
|
|
-
- dep: libc6 (>= 2.6.1-1)
- библиотека GNU C: динамически подключаемые библиотеки
также виртуальный пакет, предоставляемый libc6-udeb
-
- dep: libgmp3c2
- Multiprecision arithmetic library
Загрузка gmp-ecm
| Архитектура | Размер пакета | В установленном виде | Файлы |
|---|---|---|---|
| amd64 | 145,4 Кб | 308 Кб | [список файлов] |
| i386 | 138,7 Кб | 288 Кб | [список файлов] |