CADO-NFS is a complete implementation in C/C++ of the Number Field Sieve
(NFS) algorithm for factoring integers. 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. Starting with
version 2.0 there are some functionalities for computing discrete logarithms
in finite fields. CADO-NFS is distributed under the Gnu Lesser General
Public License (LGPL) version 2.1 (or any later version).
I am one of the main authors. I contributed to the polynomial selection
step and the filtering step.
GMP-ECM
GMP-ECM is an implementation of Lenstra's Elliptic Curve Method (ECM) for
factoring integers. GMP-ECM provides a library under the Gnu Lesser
General Public Licence (LGPL) and a binary under the Gnu General Public
Licence (GPL) version 3.
I am the author of the GPU code available in the lastest releases.