Factoring Small to Medium Size Integers: An Experimental Comparison - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

Factoring Small to Medium Size Integers: An Experimental Comparison

Jérôme Milan
  • Fonction : Auteur
  • PersonId : 844426

Résumé

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.
Fichier principal
Vignette du fichier
smallint_expcomp_draft_02_1.pdf (617.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00188645 , version 1 (19-11-2007)
inria-00188645 , version 2 (25-01-2010)
inria-00188645 , version 3 (29-01-2010)

Identifiants

  • HAL Id : inria-00188645 , version 3

Citer

Jérôme Milan. Factoring Small to Medium Size Integers: An Experimental Comparison. 2010. ⟨inria-00188645v3⟩
606 Consultations
3916 Téléchargements

Partager

Gmail Facebook X LinkedIn More