www.pgnfs.org
"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)
Sourcecode

The current version available is 0.3 which is stable but the square root step still needs some work.

pGNFS relies on the two libaries NTL and GiNaC which needs to be available to build the pGNFS executables.

The sourcecode is available here and the executables pgnfs_* can be build by a 'make all' if you have NTL and GiNaC available.

pGNFS has been succesfully built on various Linux systems, but the code is standard C++ and it should compile on all platforms where NTL and GiNaC is available.

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.