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

DOI10.2307/2008412zbMath0724.11067OpenAlexW4229996791MaRDI QIDQ5202277

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

zbMATH Keywords

factorization algorithmcomplexity boundquadratic sieveFarey intervalslattice points between two parabolas

Mathematics Subject Classification ID

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

Related Items (2)

The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance ⋮ A Rigorous Time Bound for Factoring Integers

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