Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

This question already has an answer here:

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?

share|improve this question

marked as duplicate by Thomas, yyyyyyy, DrLecter, Reid, Ilmari Karonen May 9 '15 at 11:40

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

1  
I think this answer probably answers your question (with a little thought). – Reid May 8 '15 at 22:24
    
Hm, it does seem to answer my question. Thanks! – HyperLuminal May 8 '15 at 22:31

Mathematically, yes, it will work. Practically, you will require an extremely very long time and an incredible amount of energy, considering the sizes of the primes involved in RSA (usually around 1024-bit prime numbers). It is about billion and billions of years and billions and billions times the energy of the whole universe (RSA: How effective is this keypair-trash attack)

share|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.