McKee vs. SQFOF?
 

I was wondering if anyone knew of a comparison of implementations of SQFOF vs. McKee's [url=http://www.ams.org/journals/mcom/1999-68-228/S0025-5718-99-01133-3/home.html]1999 method[/url]. Both seem to be useful in the 10 to 20 digit range.

[url]http://hal.inria.fr/inria-00188645_v3/[/url]

Thanks, that was very helpful.

Thanks, I thought so too. It saved me from writing the fast return variant of SQUFOF, since in the size range I was interested in, it appeared to have a negligible speedup.

That paper compares the varying speeds of the different methods very well but it would be nice if it took a look at combining the methods for an optimal result. For example at what number of bits would we start doing a tiny bit of ecm or p-1 before siqs.
I am guessing the recent improvements in the smallqs code in YAFU are due to this paper.