Speeding Fermat’s factoring method

DOI10.1090/S0025-5718-99-01133-3zbMath0946.11031OpenAlexW1968546374MaRDI QIDQ4257702

James McKee

Publication date: 31 August 1999

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

Full work available at URL: https://doi.org/10.1090/s0025-5718-99-01133-3

zbMATH Keywords

continued fractionsinteger factorizationquadratic sieve factoring algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (3)

A ONE LINE FACTORING ALGORITHM ⋮ Fingers find Fermat’s factorisation most probable ⋮ Integer factorization as subset-sum problem

Cites Work

• Unnamed Item
• Unnamed Item
• Halving an estimate obtained from Selberg's upper bound method
• A New Factorization Technique Using Quadratic Forms
• Turning Euler's Factoring Method into a Factoring Algorithm

This page was built for publication: Speeding Fermat’s factoring method