A one line factoring algorithm

DOI10.1017/S1446788712000146MaRDI QIDQ2898887zbMATH OpenFDO

Authors William B. Hart

Publication date 12 July 2012

Published in Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1446788712000146

zbMATH Keywords

Fermat's algorithminteger factorization methodsLehman's algorithm

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51)

Recommendations

• Speeding Fermat’s factoring method
• A Rigorous Time Bound for Factoring Integers
• scientific article; zbMATH DE number 475434
• Factoring with Two Large Primes
• A deterministic algorithm for integer factorization

Cites work

• Speeding Fermat’s factoring method
• Square form factorization

Cited in

(7)

• The improvement of initial value closer to the target for Fermat's factorization algorithm
• scientific article; zbMATH DE number 5117572 (Why is no real title available?)
• On finding Fermat’s pairs
• Efficient implementation of the Hardy-Ramanujan-Rademacher formula
• One approach to factorization of positive integers
• scientific article; zbMATH DE number 1302464 (Why is no real title available?)
• Integer factorization as subset-sum problem

This page was built for publication: A one line factoring algorithm

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