Dixon's factorization method, also called Dixon's random squares method or Dixon's algorithm, is a general-purpose integer factorization algorithm in number theory and the prototypical factor base method. Unlike other factor base methods, its run-time bound comes with a rigorous proof that does not rely on conjectures about the smoothness properties of the values taken by a polynomial. The algorithm was designed by John D. Dixon, a mathematician at Carleton University, and was published in 1981.
Connections
In Field
Source Dixon's factorization method (Wikipedia)
Uses Design Technique
Source Dixon's factorization method (Wikipedia)
Sources
Dixon's factorization method (Wikipedia)
In Group: Number Theory and Primality, Lead
is a general-purpose integer factorization algorithm; it is the prototypical factor base method.
In Field: Algorithms and Complexity Theory, Lead [in-field]
In number theory, Dixon's factorization method
Uses Design Technique: Randomized Algorithms, Lead
Dixon's random squares method
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.