Square Root Algorithms for the Number Field Sieve

DOI10.1007/978-3-642-31662-3_15MaRDI QIDQ3166983zbMATH OpenOpenAlexFDO

Authors Emmanuel Thomé

Publication date 1 November 2012

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31662-3_15

zbMATH Keywords

algebraic square rootCouveignes' algorithmMontgomery's algorithmnumber field sievep-adic approach

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 475435
• scientific article; zbMATH DE number 475432
• scientific article; zbMATH DE number 1186939
• Modifications to the number field sieve
• Root optimization of polynomials in the number field sieve
• scientific article; zbMATH DE number 177024
• An Implementation of the Number Field Sieve
• scientific article; zbMATH DE number 1185143
• scientific article; zbMATH DE number 475434
• On a strategy in the sieving procedure for the factorization of large natural numbers

Cited in

(14)

• 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
• On nonlinear polynomial selection and geometric progression (mod N) for number field sieve
• A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)
• scientific article; zbMATH DE number 1186939 (Why is no real title available?)
• Non-linear polynomial selection for the number field sieve
• scientific article; zbMATH DE number 1302464 (Why is no real title available?)
• scientific article; zbMATH DE number 475435 (Why is no real title available?)
• scientific article; zbMATH DE number 733569 (Why is no real title available?)
• Root optimization of polynomials in the number field sieve
• One approach to factorization of positive integers
• Computing \(e\)-th roots in number fields
• Improved computation of polynomial roots over number fields when using complex embeddings

This page was built for publication: Square Root Algorithms for the Number Field Sieve

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