1 research outputs found
Simple backdoors to RSA key generation
We present extremely simple ways of embedding a backdoor in the key
generation scheme of RSA. Three of our schemes generate two
genuinely random primes and of a given size, to obtain their
public product . However they generate private/public
exponents pairs in such a way that appears very random while
allowing the author of the scheme to easily factor given only
the public information . Our last scheme, similar to the PAP
method of Young and Yung, but more secure, works for any public
exponent such as by revealing the factorization of
in its own representation. This suggests that nobody should
rely on RSA key generation schemes provided by a third party