Section: New Software and Platforms

CADO-NFS

Crible Algébrique: Distribution, Optimisation - Number Field Sieve

Keywords: Cryptography - Number theory

Functional Description: CADO-NFS 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.

News Of The Year: The main program for relation collection now supports composite "special-q", and also parallelizes better. The memory footprint of the central step of linear algebra has been reduced, and the parallelism of this step has been improved.

• Participants: Pierrick Gaudry, Emmanuel Thomé and Paul Zimmermann

• Contact: Emmanuel Thomé

• URL: http://cado-nfs.gforge.inria.fr/