A generalization of Lehman's method

DOI10.1007/S11139-024-00959-7MaRDI QIDQ6645972zbMATH OpenFDO

Authors Jonathon Hales, Ghaith A. Hiary

Publication date 29 November 2024

Published in The Ramanujan Journal (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11139-024-00959-7

zbMATH Keywords

algorithminteger factorizationrational approximationsquare-free numbers

Mathematics Subject Classification ID

Factorization (11Y05)

Recommendations

• A deterministic algorithm for finding \(r\)-power divisors
• A time-space tradeoff for Lehman's deterministic integer factorization method
• Detecting perfect powers by factoring into coprimes
• A deterministic algorithm for integer factorization
• Detecting perfect powers in essentially linear time

Cites work

• A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
• A babystep-giantstep method for faster deterministic integer factorization
• A deterministic algorithm for finding \(r\)-power divisors
• An exponent one-fifth algorithm for deterministic integer factorisation
• An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
• Detecting squarefree numbers
• Factoring Large Integers
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator

This page was built for publication: A generalization of Lehman's method

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