Important changes between cado-nfs-1.0 and cado-nfs-1.1:* the polynomial selection uses the new algorithm presented by Kleinjung at the 2008 CADO workshop (supports multithreading)* connecting rootsieve5 in the polynomial selection

* las supports I=16 (useful for integers greater than 200 digits), minor bug fixes, small speedup in las and purge.* reorganization of the executable in the linear algebra step and acceleration of computing time on many machines with MPI.