Root optimization of polynomials in the number field sieve

DOI10.1090/S0025-5718-2015-02926-3zbMath1378.11104arXiv1212.1958WikidataQ56938948 ScholiaQ56938948MaRDI QIDQ5264135

Shi Bai, Richard P. Brent, Emmanuel Thomé

Publication date: 20 July 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.1958

zbMATH Keywords

number field sievepolynomial selectionHensel's lifting lemmaroot optimizationroot sieve

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (6)

On the coefficients of the polynomial in the number field sieve ⋮ Collecting relations for the number field sieve in ⋮ Better polynomials for GNFS ⋮ Montgomery's method of polynomial selection for the number field sieve ⋮ A new ranking function for polynomial selection in the number field sieve ⋮ On polynomial selection for the general number field sieve

Uses Software

• CADO-NFS
• CFRAC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The development of the number field sieve
• Integers without large prime factors
• On polynomial selection for the general number field sieve
• Factorization of a 768-Bit RSA Modulus
• A Method of Factoring and the Factorization of F 7
• Asymptotic semismoothness probabilities
• Predicting the Sieving Effort for the Number Field Sieve
• Sieving Using Bucket Sort
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Root optimization of polynomials in the number field sieve