Root optimization of polynomials in the number field sieve

Shi Bai 1 Richard Brent 2 Emmanuel Thomé 3
1 Department of Mathematics
Department of Mathematics [Auckland]
3 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : 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.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-00919367
Contributor : Emmanuel Thomé <>
Submitted on : Monday, December 16, 2013 - 4:12:54 PM
Last modification on : Thursday, February 7, 2019 - 4:59:26 PM
Long-term archiving on : Tuesday, March 18, 2014 - 4:55:35 PM

Files

rs_mcomp.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Shi Bai, Richard Brent, Emmanuel Thomé. Root optimization of polynomials in the number field sieve. Mathematics of Computation, American Mathematical Society, 2015, 84 (295), pp.2447-2457. ⟨http://www.ams.org/journals/mcom/2015-84-295/S0025-5718-2015-02926-3/⟩. ⟨10.1090/S0025-5718-2015-02926-3 ⟩. ⟨hal-00919367⟩

Share

Metrics

Record views

707

Files downloads

421