CADO-NFS, An Implementation of the Number Field Sieve Algorithm - Archive ouverte HAL Access content directly
Software Year :

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

(1, 2)
1
2

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.
430 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More