Old and new deterministic factoring algorithms

DOI10.1007/3-540-61581-4_57MaRDI QIDQ4375614zbMATH OpenFDO

Authors James Mckee, Richard Pinch

Publication date 8 February 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61581-4_57

zbMATH Keywords

deterministic factoring algorithms

Mathematics Subject Classification ID

Factorization (11Y05)

Recommendations

• A deterministic algorithm for integer factorization
• Factorization of integers
• A monte carlo method for factorization
• scientific article; zbMATH DE number 2066372

Cited in

(9)

• On the complementary factor in a new congruence algorithm
• Polylog depth circuits for integer factoring and discrete logarithms
• Integer factorization as subset-sum problem
• A deterministic algorithm for integer factorization
• Speeding Fermat’s factoring method
• On reducing factorization to the discrete logarithm problem modulo a composite
• An exponent one-fifth algorithm for deterministic integer factorisation
• The Dixon algorithm: properties, modifications, and applications
• Factoring: algorithms, computations, and computers

This page was built for publication: Old and new deterministic factoring algorithms

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