[  sarge  ] [  etch  ] [  etch-m68k  ] [  lenny  ] [  sid  ]
[ Source: gmp-ecm  ]

Paketti: gmp-ecm (6.0.1-1)

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.

Muut pakettiin gmp-ecm liittyvät paketit

  • depends
  • recommends
  • suggests
  • dep: libc6 (>= 2.3.2.ds1-4) [ei alpha, ia64]
    GNU C Library: Shared libraries and Timezone data
    myös näennäispaketti, jonka toteuttaa libc6-udeb
  • dep: libc6.1 (>= 2.3.2.ds1-4) [alpha, ia64]
    GNU C Library: Shared libraries and Timezone data
    myös näennäispaketti, jonka toteuttaa libc6.1-udeb
  • dep: libgmp3
    Multiprecision arithmetic library

Imuroi gmp-ecm

Imurointi kaikille saataville arkkitehtuureille
Arkkitehtuuri Paketin koko Koko asennettuna Tiedostot
alpha 136.4 kt324 kt [tiedostoluettelo]
amd64 (epävirallinen siirros) 119.1 kt272 kt [tiedostoluettelo]
arm 110.6 kt244 kt [tiedostoluettelo]
hppa 121.7 kt264 kt [tiedostoluettelo]
i386 115.9 kt224 kt [tiedostoluettelo]
ia64 147.0 kt396 kt [tiedostoluettelo]
m68k 103.8 kt236 kt [tiedostoluettelo]
mips 122.0 kt348 kt [tiedostoluettelo]
mipsel 122.4 kt348 kt [tiedostoluettelo]
powerpc 119.7 kt224 kt [tiedostoluettelo]
s390 113.8 kt260 kt [tiedostoluettelo]
sparc 111.7 kt256 kt [tiedostoluettelo]