CADO-NFS

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 perl script that run them, possibly in parallel over a network of computers. CADO-NFS is distributed under the Gnu Lesser General Public License (LGPL) version 2.1 (or any later version).

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 11 articles )

Showing results 1 to 11 of 11.
Sorted by year (citations)

  1. Hyun, Seung Gyu; Neiger, Vincent; Schost, Éric: Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants (2019)
  2. Faugère, Jean-Charles; Wallet, Alexandre: The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (2018)
  3. Cosgrave, John B.; Dilcher, Karl: A role for generalized Fermat numbers (2017)
  4. Fried, Joshua; Gaudry, Pierrick; Heninger, Nadia; Thomé, Emmanuel: A kilobit hidden SNFS discrete logarithm computation (2017)
  5. Sengupta, Binanda; Das, Abhijit: Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (2017)
  6. Bai, Shi; Bouvier, Cyril; Kruppa, Alexander; Zimmermann, Paul: Better polynomials for GNFS (2016)
  7. Bouillaguet, Charles; Delaplace, Claire: Sparse Gaussian elimination modulo (p): an update (2016)
  8. Bai, Shi; Brent, Richard P.; Thomé, Emmanuel: Root optimization of polynomials in the number field sieve (2015)
  9. Bouyer, Florian; Streng, Marco: Examples of CM curves of genus two defined over the reflex field (2015)
  10. Coxon, Nicholas: Montgomery’s method of polynomial selection for the number field sieve (2015)
  11. Cosgrave, J. B.; Dilcher, K.: The Gauss-Wilson theorem for quarter-intervals (2014)