Project presentation

The goal of the CADO project is to study the number field sieve algorithm (NFS) for factoring integers. The aspects we are particularly focusing on are:

The polynomial selection
The post-sieving refactoring phase
The practical impact of Coppersmith's variants
The parallelisation of the linear algebra
We plan to develop our own software, implementing the NFS algorithm.
Powered By GForge Collaborative Development Environment Valid XHTML 1.0 Strict
Last modification: Thu 25 Sep 2008 09:09:02 AM CEST
© 2008– members of the project ; valid XHTML 1.0, valid CSS