Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms

DOI10.2307/2008412zbMATH Open0724.11067OpenAlexW4229996791MaRDI QIDQ5202277FDOQ5202277

Authors: Brigitte Vallée 

Publication date: 1991

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2008412

Recommendations

• Smooth numbers and the quadratic sieve
• Publication:3033825
• The Dixon algorithm: properties, modifications, and applications
• The Multiple Polynomial Quadratic Sieve
• A Rigorous Time Bound for Factoring Integers
• Factoring Integers with Large-Prime Variations of the Quadratic Sieve
• scientific article; zbMATH DE number 3959521
• scientific article; zbMATH DE number 177024
• scientific article; zbMATH DE number 475434
• scientific article; zbMATH DE number 3970826

zbMATH Keywords

complexity boundfactorization algorithmquadratic sieveFarey intervalslattice points between two parabolas

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Farey sequences; the sequences (1^k, 2^k, dots) (11B57) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Cited In (5)

• The geometry of provable security: some proofs of security in which lattices make a surprise appearance
• Title not available (Why is that?)
• On sharp transitions in making squares
• A Rigorous Time Bound for Factoring Integers
• An improved sieve of Eratosthenes

This page was built for publication: Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms

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