Optimal Parameterization of SNFS

DOI10.1515/JMC.2007.007MaRDI QIDQ5295345zbMATH OpenOpenAlexWikidataFDO

Authors Robert D. Silverman

Publication date 27 July 2007

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/jmc.2007.007

zbMATH Keywords

factoringGNFSnumber field sieveparameter selectionSNFS

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Numerical optimization and variational techniques (65K10) Distributed algorithms (68W15) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 475436
• On polynomial selection for the general number field sieve
• scientific article; zbMATH DE number 475432
• scientific article; zbMATH DE number 1024053
• Better polynomials for GNFS

Cites work

• Asymptotic semismoothness probabilities
• On a problem of Oppenheim concerning Factorisatio Numerorum
• The Multiple Polynomial Quadratic Sieve

Cited in

(4)

• Parameter trade-offs for NFS and ECM
• Some mathematical remarks on the polynomial selection in NFS
• Optimization strategies for hardware-based cofactorization
• Optimality for the two-parameter quadratic sieve

This page was built for publication: Optimal Parameterization of SNFS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295345)