Turning Euler's Factoring Method into a Factoring Algorithm

DOI10.1112/BLMS/28.4.351MaRDI QIDQ4893604zbMATH OpenOpenAlexWikidataFDO

Authors James Mckee

Publication date 26 May 1997

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

Full work available at URL https://doi.org/10.1112/blms/28.4.351

zbMATH Keywords

primality testingalgorithm for factoring integersEuler's factoring algorithm

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Sums of squares and representations by other particular quadratic forms (11E25) Factorization; primality (11A51) Primality (11Y11)

Recommendations

• Factoring integers
• The completion of Euler's factoring formula
• A deterministic algorithm for integer factorization
• Speeding Fermat’s factoring method
• scientific article; zbMATH DE number 2066372

Cited in

(5)

• Speeding Fermat’s factoring method
• scientific article; zbMATH DE number 2068209 (Why is no real title available?)
• Euler's E228: primality testing and factoring via sums of squares
• A deterministic algorithm for integer factorization
• The completion of Euler's factoring formula

This page was built for publication: Turning Euler's Factoring Method into a Factoring Algorithm

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