Chapitre D'ouvrage Année : 2017

FFT extension for algebraic-group factorization algorithms

Résumé

It is well known that the second stage of factoring methods that exploit smoothness of group orders can be implemented efficiently using the fast Fourier transform (FFT). For Pollard's p−1 method [17] this originated with the Mont-gomery and Silverman paper [16], and for the elliptic curve factoring method [12] it was the subject of Peter Montgomery's PhD dissertation [14]. Along with Peter's most recent work on this subject [15], these developments are presented in this chapter.

Fichier principal
Vignette du fichier
Chap8.pdf (162.23 Ko) Télécharger le fichier
Origine Accord explicite pour ce dépôt
Licence
Loading...
DOI

Cite 10.1017/9781316271575.009 Autre Brent, R. P., Kruppa, A., & Zimmermann, P. (n.d.). FFT Extension for Algebraic-Group Factorization Algorithms. In Topics in Computational Number Theory Inspired by Peter L. Montgomery (pp. 189–205). Cambridge University Press. https://doi.org/10.1017/9781316271575.009

Dates et versions

hal-01630907 , version 1 (09-11-2017)

Licence

Identifiants

  • HAL Id : hal-01630907 , version 1

Citer

Richard P. Brent, Alexander Kruppa, Paul Zimmermann. FFT extension for algebraic-group factorization algorithms. Joppe W. Bos; Arjen K. Lenstra. Topics in Computational Number Theory Inspired by Peter L. Montgomery, Cambridge University Press, pp.189-205, 2017, 978-1-107-10935-3. ⟨hal-01630907⟩
504 Consultations
454 Téléchargements

Partager

  • More