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)
Projects

These are some of the things that can be done to improve the code, when times permit I will work on some of them.

Possible improvements:

  • Sieving experiments in the polynomial selection step.
  • Try lattice sieving in the sieving step.
  • Implement the Block Lanczos algorithm to replace the rather primitive Gaussian Elimination.
  • Implement Montgomery's algorithm for computing the algebraic square root.
  • Find better format for storing temporary files and base files both for saving storage space and for doing faster reading/writing of data.
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.