Factoring Small to Medium Size Integers: An Experimental Comparison

Jérôme Milan 1
1 TANC - Algorithmic number theory for cryptology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, Polytechnique - X, CNRS - Centre National de la Recherche Scientifique : UMR7161
Abstract : We report on our experiments in factoring integers from 50 to 200 bit with the NFS postsieving stage or class group structure computations as potential applications. We implemented, with careful parameter selections, 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 continued fraction algorithm in light of recent advances in smoothness detection batch methods. We provide detailed timings for our implementations to better assess their relative range of practical use on current commodity hardware.
Document type :
Preprints, Working Papers, ...
Fixed a stupid but glaring mistake in the description of the ECM algorithm. 2010
Liste complète des métadonnées


https://hal.inria.fr/inria-00188645
Contributor : Jérôme Milan <>
Submitted on : Friday, January 29, 2010 - 2:30:00 PM
Last modification on : Friday, February 10, 2017 - 1:12:22 AM
Document(s) archivé(s) le : Wednesday, November 30, 2016 - 11:47:32 AM

File

smallint_expcomp_draft_02_1.pd...
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00188645, version 3

Collections

Citation

Jérôme Milan. Factoring Small to Medium Size Integers: An Experimental Comparison. Fixed a stupid but glaring mistake in the description of the ECM algorithm. 2010. <inria-00188645v3>

Share

Metrics

Record views

543

Document downloads

467