Abstract
This paper contains a brief review of some old deterministic factoring algorithms, and describes two new ones. The algorithms discussed are true algorithms: given a positive integer n, they will either find a non-trivial factor of n, or, by failing to do so, will prove n to be prime. One of the new algorithms removes the Monte Carlo element from a method of Pollard, involving discrete logarithms mod n. The other generalises an idea of Lehmer for speeding up Fermat's factoring method.
The authors acknowledge the hospitality of the Isaac Newton Institute for Mathematical Sciences, Cambridge, while completing the work described in this paper.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brillhart, J., Selfridge, J.L.: Some factorizations of 2n±1 and related results. Math. Comp. 21 (1967) 87–96
Coppersmith, D.: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. (preprint).
Lehman, R.S.: Factoring large integers. Math. Comp. 28 (1974) 637–646
Lenstra, Jr., H.W.: Divisors in residue classes. Math. Comp. 42 (1984) 331–340
McKee, J.F.: Turning Euler's factoring method into a factoring algorithm. Bull. London Math. Soc. (to appear)
McKee, J.F.: A √q/p factoring method. (in preparation)
Pollard, J.M.: Theorems on factorization and primality testing. Proc. Cambridge Phil. Soc. 76 (1974) 521–528
Pollard, J.M.: Monte Carlo methods for index computation (mod p). Math. Comp. 32 (1978) 918–924
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21 (1978)
Schoof, R.J.: Quadratic fields and factorization. Computational Methods in Number Theory, Part II, edited by H.W. Lenstra, Jr. and R. Tijdeman, Mathematical Centre Tracts 155, Mathematisch Centrum, Amsterdam (1982)
Shanks, D.: Class number, a theory of factorization and genera. Proc. Symp. Pure Math. 20 AMS (1971) 415–440
Strassen, V.: Einige Resultate über Berechnungskomplexität. Jahresber. Deutsch. Math.-Verein. 78 (1976/77) 1–8
Turk, J.W.M.: Fast arithmetic operations on numbers and polynomials. Computational Methods in Number Theory, Part I, edited by H.W. Lenstra, Jr. and R. Tijdeman, Mathematical Centre Tracts 154, Mathematisch Centrum, Amsterdam (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McKee, J., Pinch, R. (1996). Old and new deterministic factoring algorithms. In: Cohen, H. (eds) Algorithmic Number Theory. ANTS 1996. Lecture Notes in Computer Science, vol 1122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61581-4_57
Download citation
DOI: https://doi.org/10.1007/3-540-61581-4_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61581-1
Online ISBN: 978-3-540-70632-8
eBook Packages: Springer Book Archive