Re: Factoring program

From: AMMS716 (amms716_at_aol.com)
Date: 09/02/03 

Date: 02 Sep 2003 14:54:20 GMT

No offense intended, but your reply shows
that you would not know how to run an
NFS implementation.

You wrote "the executable".

An NFS implementation consists of
multiple executables.

- one to find good polynomials
- one to solve the polynomials modulo the
  factor bases
- one to sieve
- one to filter the data and create the matrix
- one to solve the matrix
- one to find the square root.

There are also many parametric choices to be made. One needs a good
understanding
of the algorithm to make them.

As for "run times", it takes about 200 PC's
about a month to sieve then another week
or two to solve the matrix on a supercomputer with very large memory to
run GNFS on a 512-bit number. The
"run times" are not something which can
be casually observed on a couple of PC's.

Loading