Introduction
CADONFS is a complete implementation in C/C++ of the Number Field Sieve (NFS) algorithm for factoring integers and computing discrete logarithms in finite fields. It consists in various programs corresponding to all the phases of the algorithm, and a general script that runs them, possibly in parallel over a network of computers. CADONFS is distributed under the Gnu Lesser General Public License (LGPL) version 2.1 (or any later version).
CADONFS is the result of a collaborative effort involving many persons, over various periods of time. The current list of active contributors can be extracted from the git repository or from the openhub.net page. A tentative list of CADONFS authors is (alphabetical order):


Citing CADONFS
The recommended way to cite CADONFS in a scientific publication is (bibtex entry):
 The CADONFS Development Team. CADONFS, An Implementation of the Number Field Sieve Algorithm, Release 2.3.0, 2017, http://cadonfs.inria.fr/
where the release number and date should be changed to correspond to the version you actually used. If you used the development version, it is a good idea to give the git revision number. You can, at the very least, say "development version" and give the current date. You can base your citation entry on the following template (bibtex entry for the development version, to be completed):
 The CADONFS Development Team. CADONFS, An Implementation of the Number Field Sieve Algorithm, development version, 20XX, http://cadonfs.inria.fr/
Features
Algorithms used in CADONFS 2.3.0 are the following:
 The polynomial selection uses the algorithm of Kleinjung (2008) then candidate polynomials are optimized using the algorithm of Bai, Bouvier, Kruppa and Zimmermann (2014)
 The filtering step follows Cavallar's thesis and Bouvier's work. Right now it is partly parallel.
 Relation search is done using lattice sieving, including multithread support to reduce memory.
 The linear algebra step is implemented using block Wiedemann algorithm. This implementation is parallel at multithread and MPI levels.
 The square root step uses the naive algorithm and is parallel. An alternate (experimental) implementation is available for very large computations, or pathological Galois groups.
Speed comparison of CADONFS versions 1.1 and 2.0, obtained on a dual
8core Intel(R) Xeon(R) CPU E52650 at 2.00GHz, running Linux 3.2.0.
Both CADO releases were compiled with gcc 4.7.2.
With CADONFS 1.1 using cadofactor.pl, the timing runs used 16 processes
of 1 thread each for polynomial selection and 8 processes of 2 threads
each for sieving;
with CADONFS 2.0 using cadofactor.py, both phases used 8 processes of
two threads each,
with CADONFS 2.1 using ./factor.sh N s 8 t 2 tasks.linalg.bwc.threads=16.
With CADONFS 2.3, the same behavior is obtained with ./cadonfs.py
clientthreads 2 serverthreads 16 slaves 8.
The table below lists CPU time [wall clock time in square brackets].
Input number  CADONFS 1.1  CADONFS 2.0  CADONFS 2.1  CADONFS 2.2.0  CADONFS 2.3.0 

RSA120  100 hours  45.6 hours  45.2 hours [3.6 hours]  32.2 hours [2.2 hours]  26 hours [1.9 hours] 
RSA130  288 hours  231 hours  219 hours [15.9 hours]  124 hours [8.2 hours]  107 hours [7.5 hours] 
RSA140  809 hours  614 hours  643 hours [45.7 hours]  469 hours [30.9 hours]  352 hours [23 hours] 
RSA155  268 days  141 days  126 days [12.2 days]  90 days [5.8 days]  83 days [5.3 days] 
For 85 to 100digits, Ben Buhrow compared various QS and NFS tools, see here.
You can browse into the development tree history to find the NEWS file for past releases:
© 2006– The CADONFS Development Team. ; valid XHTML 1.0, valid CSS