Non-linear polynomial selection for the number field sieve

DOI10.1016/j.jsc.2011.09.004zbMath1278.11107OpenAlexW2022432349MaRDI QIDQ412202

Thomas Prest, Paul Zimmermann

Publication date: 4 May 2012

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.09.004

zbMATH Keywords

integer factorizationnumber field sievepolynomial selection

Mathematics Subject Classification ID

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

Related Items (4)

On the coefficients of the polynomial in the number field sieve ⋮ Montgomery's method of polynomial selection for the number field sieve ⋮ Selecting polynomials for the Function Field Sieve ⋮ On polynomial selection for the general number field sieve

Cites Work

• Unnamed Item
• The LLL algorithm. Survey and applications
• Factoring polynomials with rational coefficients
• An Implementation of the Number Field Sieve
• On polynomial selection for the general number field sieve
• Factorization of a 768-Bit RSA Modulus
• LLL: A Tool for Effective Diophantine Approximation

This page was built for publication: Non-linear polynomial selection for the number field sieve