Integer factorization: Difference between revisions

Revision as of 17:25, 8 April 2004

Revision as of 17:27, 8 April 2004

Line 37:

===General-purpose===

A general-purpose factoring algorithm's running time 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.

* [[Quadratic sieve]]

* [[General number field sieve]]