Editing Integer factorization (section)

=== General-purpose ===
A general-purpose factoring algorithm, also known as a ''Category 2'', ''Second Category'', or [[Maurice Kraitchik|''Kraitchik'']] ''family'' algorithm,<ref name="Bressoud and Wagon"/> has a running time which depends solely on the size of the integer to be factored. This is the type of algorithm used to factor [[RSA number]]s. Most general-purpose factoring algorithms are based on the [[congruence of squares]] method.

* [[Dixon's factorization method]]
* [[Continued fraction factorization]] (CFRAC)
* [[Quadratic sieve]]
* [[Rational sieve]]
* [[General number field sieve]]
* [[Shanks's square forms factorization]] (SQUFOF)