Factoring Small Integers: An Experimental Comparison
Résumé
In this data-based paper we report on our experiments in factoring integers from 50 to 200 bits with the postsieving phase of NFS as a potential application. We implemented and compared several general-purpose factoring algorithms suited for these smaller numbers, from Shanks's square form factorization method to the self-initializing quadratic sieve, and revisited the older continued fraction method testing new practical ideas. We give detailed timings for our implementations to better assess their relative range of practical use on current hardware.
Origine : Fichiers produits par l'(les) auteur(s)