HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

CADO-NFS, An Implementation of the Number Field Sieve Algorithm

The Cado-Nfs Development Team 1, 2
1 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
2 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : 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.
Document type :
Complete list of metadata

Contributor : Pierrick Gaudry Connect in order to contact the contributor
Submitted on : Monday, April 15, 2019 - 10:48:53 AM
Last modification on : Tuesday, March 15, 2022 - 12:55:45 PM


The Cado-Nfs Development Team. CADO-NFS, An Implementation of the Number Field Sieve Algorithm. 2019. ⟨hal-02099620⟩



Record views