Abstract
Our only factorization algorithm so far is Algorithm 2.4, which will work fine for numbers up to ten or eleven digits, but quickly bogs down after that. Part of the problem with trial division is that it does too much. It is not only a factorization algorithm, it will also prove primality as long as you have the time to test for divisibility up to the square root of the number in question.
“The term Science should not be given to anything but the aggregate of the recipes that are always successful. All the rest is literature.”
- Paul Valéry
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Richard P. Brent, “An Improved Monte Carlo Factorization Algorithm,” Nordisk Tidskrift for Informationsbehandling (BIT), 20(1980), 176–184.
M. Kraitchik, Théorie des nombres, Gauthier-Villars, Paris, 1926.
M. Kraitchik, Recherches sur la théorie des nombres, Gauthier-Villars, Paris, 1929.
D. H. Lehmer and R. E. Powers, “On factoring large numbers,” Bull. Amer. Math. Soc., 37(1931), 770–776.
Michael A. Morrison and John Brillhart, “A Method of Factoring and the Factorization of F7,” Math. Compu., 29(1975), 183–205.
J. M. Pollard, “Theorems on Factorization and Primality Testing,” Proc. Camb. Philo. Soc., 76(1974),521–528.
J. M. Pollard, “A Monte Carlo Method for Factorization,” Nordisk Tidskrift for Informationsbehangling (BIT), 15(1975), 331–334.
Carl Pomerance, “Analysis and Comparison of some Integer Factoring Algorithms,” pp. 89–139 in Computational Methods in Number Theory, Part I, R. Tijdeman, eds., Mathematical Centre Tract #154, Mathematisch Centrum, Amsterdam, 1982.
Carl Pomerance, “Lecture Notes on Primality Testing and Factoring,” notes by Stephen M. Gagola, Jr., Mathematical Association of America Notes, Number 4, Washington, D.C., 1983.
Hans Riesel, Prime Numbers and Computer Methods for Factorization, second printing, Birkhauser, Boston, 1987.
Daniel Shanks, “Class number, a theory of factorization, and genera,” pp. 415–440 in Proceedings of Symposia in Pure Mathematics, Vol. 20, American Mathematical Society, Providence, R.I., 1971.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Bressoud, D.M. (1989). Factorization Techniques from Fermat to Today. In: Factorization and Primality Testing. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4544-5_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4544-5_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-8871-8
Online ISBN: 978-1-4612-4544-5
eBook Packages: Springer Book Archive