Пакет: gmp-ecm (7.0.4+ds-5)
Ссылки для gmp-ecm
Ресурсы Trisquel:
Исходный код gmp-ecm:
Сопровождающий:
Original Maintainers:
- Debian Science Maintainers (Почтовый архив)
- Jerome Benoit
Внешние ресурсы:
- Сайт [ecm.gforge.inria.fr]
Подобные пакеты:
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
|
|
|
-
- dep: libc6 (>= 2.28) [armhf]
- GNU C Library: Shared libraries
также виртуальный пакет, предоставляемый libc6-udeb
- dep: libc6 (>= 2.7) [amd64]
-
- dep: libecm1
- factor integers using the Elliptic Curve Method -- lib
-
- dep: libgmp10 (>= 2:6.1)
- Multiprecision arithmetic library
Загрузка gmp-ecm
| Архитектура | Размер пакета | В установленном виде | Файлы |
|---|---|---|---|
| amd64 | 105,5 Кб | 311 Кб | [список файлов] |
| armhf | 102,9 Кб | 286 Кб | [список файлов] |