scientific article; zbMATH DE number 1186939

MaRDI QIDQ3840158zbMATH OpenFDO

Authors

Publication date 23 April 2002

zbMATH Keywords

algebraic numbercomplexitycomputation of the square rootfactoring algorithmnumber field sieve

Mathematics Subject Classification ID

Sieves (11N35) Algebraic numbers; rings of algebraic integers (11R04) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Recommendations

• scientific article; zbMATH DE number 475435
• Square Root Algorithms for the Number Field Sieve
• scientific article; zbMATH DE number 475432
• scientific article; zbMATH DE number 475436

Cited in

(9)

• The space complexity analysis in the general number field sieve integer factorization
• Square Root Algorithms for the Number Field Sieve
• On polynomial selection for the general number field sieve
• scientific article; zbMATH DE number 475435 (Why is no real title available?)
• scientific article; zbMATH DE number 733569 (Why is no real title available?)
• On the coefficients of the polynomial in the number field sieve
• LLL: a tool for effective Diophantine approximation
• A Kilobit Special Number Field Sieve Factorization
• Topics in computational algebraic number theory

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 Q3840158)