This is a project that factors a 168-digit number, using the Special Number Field Sieve (SNFS). This specific Cunningham number, 5,283+, appears on the list of wanted numbers issued with "page 86" (cf. The Cunningham Project ). The program collects data used to build a large matrix, precisely the same method used to break RSA-keys. Depending upon the results of preliminary work presently in progress, we may continue with the next RSA Challenge number, RSA-576, when sieving for 5,283+ finishes (cf. The New RSA Factoring Challenge ).
The program claims to want 64Mb of RAM, but runs well with smaller amounts. If you have under 96Mb of RAM, you might try using 40Mb, which runs well on Lehigh's public sgi sites. NOTE: All programs and initialization files are copyright Arjen K. Lenstra, as indicated.
There's a tarfile that has everything at once, available in a gzip'd version here or the uncompressed version nfs-5283p . There's a Makefile and instructions included.
Online instructions and the Windows versions are still: Under Construction ...