It does say "stupid" right there in the title :-) The article about prime gaps is interesting, thanks for sharing. There's a paper[0] that appears to use a ve

It does say "stupid" right there in the title :-) The article about prime gaps is interesting, thanks for sharing. There's a paper[0] that appears to use a very similar technique to achieve an RSA backdoor, however I don't have access to the full article. From the excerpt[1] I was able to find (just now - I wrote the code quite a while ago) they appear to choose p, randomly generate n with data spliced in the top half of the modulus, and find an acceptable q. The paper seems to argue the scheme is secure against those who don't have the backdoor key, but there are some pages hidden in the middle of that. 0. http://link.springer.com/chapter/10.1007%2F11693383_9 http://link.springer.com/chapter/10.1007%2F11693383_9 1. https://books.google.com/books?id=skYDCAAAQBAJ&pg=PA128&lpg=PA128&dq=space+efficient+rsa+backdoor&source=bl&ots=KVNcXU6iWS&sig=7_sztRtcFcaFSzA2_xymwqJf9jk&hl=en&sa=X&ei=gENOVYTJBpPooAT2o4GgCg&ved=0CDIQ6AEwAw#v=onepage&q=space%20efficient%20rsa%20backdoor&f=false https://books.google.com/books?id=skYDCAAAQBAJ&pg=PA128&lpg=...