Running Time Predictions for Factoring Algorithms

DOI10.1007/978-3-540-79456-1_1MaRDI QIDQ3502724zbMATH OpenOpenAlexFDO

Authors Ernie Croot, Andrew Granville, Robin Pemantle, Prasad Tetali

Publication date 27 May 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79456-1_1

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms (68W40)

Recommendations

• On sharp transitions in making squares
• A Rigorous Time Bound for Factoring Integers
• scientific article; zbMATH DE number 177024
• On the distribution of running times of certain integer factoring algorithms
• scientific article; zbMATH DE number 475434

Cites work

• Asymptotically Fast Factorization of Integers
• Enumerative problems inspired by Mayer's theory of cluster integrals
• Factoring with Two Large Primes
• scientific article; zbMATH DE number 3959521 (Why is no real title available?)
• scientific article; zbMATH DE number 475434 (Why is no real title available?)
• scientific article; zbMATH DE number 733561 (Why is no real title available?)
• scientific article; zbMATH DE number 1031006 (Why is no real title available?)
• scientific article; zbMATH DE number 2086904 (Why is no real title available?)
• scientific article; zbMATH DE number 783336 (Why is no real title available?)
• scientific article; zbMATH DE number 849975 (Why is no real title available?)
• scientific article; zbMATH DE number 903721 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• Large character sums
• On Integers Free of Large Prime Factors
• On sharp transitions in making squares
• Predicting the Sieving Effort for the Number Field Sieve
• Sharp thresholds of graph properties, and the k-sat problem
• Smooth numbers and the quadratic sieve
• The Multiple Polynomial Quadratic Sieve

Cited in

(2)

• On the distribution of running times of certain integer factoring algorithms
• On sharp transitions in making squares

This page was built for publication: Running Time Predictions for Factoring Algorithms

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