# If someone had a list of all primes, would it be possible for them to factor any integer in polynomial time? [duplicate]

For example, if they somehow got a function that would churn out any arbitrary amount of primes in a row. Could they break the RSA problem then?

• I think this answer probably answers your question (with a little thought). – Reid May 8 '15 at 22:24