Пакет: gmp-ecm (7.0.5+ds-1)

[ Източник: gmp-ecm  ]

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.

Етикети: Field: Математика, Implemented in: Need an extra tag, implemented-in::c, interface::commandline, Role: Program, Наука: science::calculation, scope::utility, Purpose: Calculating

Други пакети, свързани с gmp-ecm

• dep: libc6 (>= 2.28)

  GNU C Library: Shared libraries
  също и виртуален пакет, предлаган от libc6-udeb

• dep: libecm1 (>= 7.0.5+ds)

  factor integers using the Elliptic Curve Method -- lib

• dep: libgmp10 (>= 2:6.2.1+dfsg)

  Multiprecision arithmetic library

Изтегляне на gmp-ecm

Изтегляне за всички налични архитектури

Архитектура	Големина на пакета	Големина след инсталиране	Файлове
armel	264,1 кБ	477,0 кБ	[списък на файловете]