scientific article; zbMATH DE number 733569

MaRDI QIDQ4325965zbMATH OpenFDO

Authors Peter L. Montgomery

Publication date 24 August 1995

zbMATH Keywords

factoring large integerslattice basis reductionnumber field sievesquare roots of algebraic numbers

Mathematics Subject Classification ID

Factorization (11Y05) Algebraic number theory computations (11Y40)

Recommendations

• scientific article; zbMATH DE number 475435
• scientific article; zbMATH DE number 475434
• Square Root Algorithms for the Number Field Sieve
• scientific article; zbMATH DE number 1186939
• An Implementation of the Number Field Sieve

Cited in

(10)

• On the computation of Hilbert class fields
• Rigorous analysis of a randomised number field sieve
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• The space complexity analysis in the general number field sieve integer factorization
• scientific article; zbMATH DE number 475435 (Why is no real title available?)
• LLL: a tool for effective Diophantine approximation
• A Kilobit Special Number Field Sieve Factorization
• When e-th Roots Become Easier Than Factoring
• Topics in computational algebraic number theory
• We are on the same side. Alternative sieving strategies for the number field sieve

This page was built for publication:

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