RSA vulnerabilities with small prime difference

Abstract

The security of the RSA cryptosystem is based on the assumption that recovering the private key from a public pair is a hard task. However, if the private key is smaller than some bound the system is considered to be insecure. An RSA modulus with a small difference of its prime factors also significantly reduces the overall security. We show that the bound on small private key with respect to small prime difference can be further improved. Therefore, we adapt the technique of unravelled linearization for constructing lattices and although the adapted unravelled linearization is only a method for generating lattices in more elegant way, we yield a benefit compared to known bounds. © 2012 Springer-Verlag.