pGNFS - A GNFS implementation

"The problem of distinguishing prime numbers from composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic. [...]
The dignity of the science itself seems to require that every possible means be explored for the solution of a problem so elegant and so celebrated."
Carl Friedrich Gauss (1777-1855)

Howto

When the executables have been built you can start to use pGNFS.

You need 2 files: an input file with the parameters for the programs and a file containing at least the primes up to the bound you specify for the bases in the input file.

Here is a file containing the primes below 10000.

Here is an example of an input file for pGNFS.

News

Updated: 07-12-2005

Detailed plan for further development is in progress.
Defense of thesis was successfully held on December 2nd. Slides here (in danish).
Handed in thesis.
Uploaded pGNFS-0.3.
Finished thesis.
Uploaded source.