Better polynomials for GNFS - Archive ouverte HAL Access content directly
Journal Articles Mathematics of Computation Year : 2016

Better polynomials for GNFS

(1) , (2) , (2) , (2)
1
2

Abstract

The general number field sieve (GNFS) is the most efficient algo-rithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the selected polynomials can be modelled in terms of size and root properties. We propose a new kind of polynomials for GNFS: with a new degree of freedom, we further improve the size property. We demonstrate the efficiency of our algorithm by exhibiting a better polynomial than the one used for the factorization of RSA-768, and a polynomial for RSA-1024 that outperforms the best published one.
Fichier principal
Vignette du fichier
sopt-20140905.pdf (209.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01089507 , version 1 (01-12-2014)

Identifiers

Cite

Shi Bai, Cyril Bouvier, Alexander Kruppa, Paul Zimmermann. Better polynomials for GNFS. Mathematics of Computation, 2016, 85, pp.12. ⟨10.1090/mcom3048⟩. ⟨hal-01089507⟩
1048 View
789 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More