Smooth numbers and the quadratic sieve

zbMATH Open1188.11065MaRDI QIDQ3615919FDOQ3615919

Authors: Carl Pomerance 

Publication date: 24 March 2009

Recommendations

• scientific article; zbMATH DE number 3959521
• Factoring Integers with Large-Prime Variations of the Quadratic Sieve
• scientific article; zbMATH DE number 475434
• scientific article; zbMATH DE number 475432
• scientific article; zbMATH DE number 733561

zbMATH Keywords

complexitysmooth numbersquadratic sieve

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Sieves (11N35)

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms
• On sharp transitions in making squares
• A refinement of the function \(g(x)\) on Grimm's conjecture
• Integer factorization as subset-sum problem
• A new quantum algorithm for computing RSA ciphertext period
• Smooth numbers in Beatty sequences
• Optimality for the two-parameter quadratic sieve
• Running Time Predictions for Factoring Algorithms

This page was built for publication: Smooth numbers and the quadratic sieve

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