Root optimization of polynomials in the number field sieve

Root optimization of polynomials in the number field sieve

The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be modelled in terms of size and root properties. In th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics of computation 2015-09, Vol.84 (295), p.2447-2457
Hauptverfasser: Bai, Shi, Brent, Richard P., Thomé, Emmanuel
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Cryptography and Security
Mathematics
Number Theory
Research article
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection can be modelled in terms of size and root properties. In this paper, we describe some algorithms for selecting polynomials with very good root properties.
ISSN:0025-5718
1088-6842
DOI:10.1090/S0025-5718-2015-02926-3