In number theory, Dixon's factorization method (also Dixon's random squares method or Dixon's algorithm) is a general-purpose integer factorization algorithm; it is the prototypical factor base method, and the only factor base method for which a run-time bound not reliant on conjectures about the smoothness properties of values of a polynomial is known.
The algorithm was designed by John D. Dixon, a mathematician at Carleton University, and was published in 1981.
Read more about Dixon's Factorization Method: Basic Idea, Method, Example, Optimizations
Famous quotes containing the word method:
“The insidiousness of science lies in its claim to be not a subject, but a method. You could ignore a subject; no subject is all-inclusive. But a method can plausibly be applied to anything within the field of consciousness.”
—Katharine Fullerton Gerould (1879–1944)