Quantum Computing.
number n. The best known algorithm to find the prime factorization of an integer n is the general number field sieve which requires a number of steps that grows like the exponential of l^(1/3) (log l)^(2/3) where l is the number of bits of n. The special case of a number with two prime factors of