Montgomery's method of polynomial selection for the number field sieve

DOI10.1016/j.laa.2015.07.025zbMath1357.11121arXiv1109.6398OpenAlexW2963436579MaRDI QIDQ745185

Nicholas Coxon

Publication date: 13 October 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

number field sievepolynomial selectioninteger factorisationMontgomery's method

Mathematics Subject Classification ID

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

Related Items (1)

Montgomery's method of polynomial selection for the number field sieve

Uses Software

• CADO-NFS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-linear polynomial selection for the number field sieve
• The development of the number field sieve
• Montgomery's method of polynomial selection for the number field sieve
• Determinantal identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley
• The LLL algorithm. Survey and applications
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Implicitizing rational curves by the method of moving algebraic curves
• An elementary approach to subresultants theory.
• ON NONLINEAR POLYNOMIAL SELECTION AND GEOMETRIC PROGRESSION (MOD N) FOR NUMBER FIELD SIEVE
• Better polynomials for GNFS
• On polynomial selection for the general number field sieve
• Factorization of a 768-Bit RSA Modulus
• COMMON FACTORS OF RESULTANTS MODULO p
• A method for obtaining digital signatures and public-key cryptosystems
• Root optimization of polynomials in the number field sieve
• On the Number of Distinct Terms in the Expansion of Symmetric and Skew Determinants

This page was built for publication: Montgomery's method of polynomial selection for the number field sieve