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

Is there a big dataset containing RSA public $(n,e)$ and private keys $d$ and primes $p,q$ where $n = p.q$ ?

share|improve this question
What do you need that set for? Since you want private keys too, the easiest solution is generating such a set yourself. – CodesInChaos Dec 16 '12 at 9:57
If you meant a list of all possible keypairs, this may help put things into perspective (by the way, saving $d$ is unnecessary if you already know $p$ and $q$ as it can be efficiently calculated from $e$). – Thomas Dec 16 '12 at 22:46

No. You can generate such a dataset for yourself by generating lots of RSA keypairs yourself. Therefore, there's no need for such a dataset (and no reason why anyone would publish one).

share|improve this answer
Indeed. There are big datasets containing RSA public $(n,e)$ in actual use, and some of them come with revocation certificates; but that does not give $d$, $p$, $q$. There are a few small datasets of test RSA keys matching the question, except for size of the set. Some sites, including this one, will generate one such key for you (but it should not be trusted for anything other than a test). – fgrieu Dec 16 '12 at 14:34

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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