Balík: libecm1 (7.0.6+ds-1) [debports]

[ Zdroj:  ]

factor integers using the Elliptic Curve Method -- lib

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 shared library.

Ostatné balíky súvisiace s balíkom libecm1

• dep: libc6 (>= 2.34)

  knižnica GNU C - zdieľané knižnice
  tiež virtuálny balík poskytovaný balíkom libc6-udeb

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

  aritmetická knižnica s viacnásobnou presnosťou

Stiahnuť libecm1

Stiahnuť pre všetky dostupné architektúry

Architektúra	Veľkosť balíka	Nainštalovaná veľkosť	Súbory
m68k (neoficiálny port)	184.0 kB	517.0 kB	[zoznam súborov]