An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, and has complexity O{exp[c(log n)^(1/3) (log log n)^(2/3)]}, reducing the exponent over the continued fraction factorization algorithm and quadratic sieve. There are three values of c relevant to different flavors of the method.

quadratic sieve | RSA number