Thread: CADO
View Single Post
Old 2008-11-05, 19:29   #4
R.D. Silverman
R.D. Silverman's Avatar
Nov 2003

746010 Posts

Originally Posted by jasonp View Post

- Alex Kruppa went through a long list of changes that are necessary for a lattice siever to find more than two large primes in relations, combined with building a network of factoring strategies that include P+-1 and ECM with parameters optimized for small inputs. Currently the CADO lattice siever finds relations with three large primes 25% faster than with two large primes
There are no proceedings from the workshop, only the slides (available online).
Didn't Alex give any consideration to splitting the cofactors with QS?
I have found that it is faster than the alternatives.....
R.D. Silverman is offline   Reply With Quote