RSA Vulnerabilities with Small Prime Difference

  • Marián Kühnel
Conference paper

DOI: 10.1007/978-3-642-34159-5_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7242)
Cite this paper as:
Kühnel M. (2012) RSA Vulnerabilities with Small Prime Difference. In: Armknecht F., Lucks S. (eds) Research in Cryptology. WEWoRC 2011. Lecture Notes in Computer Science, vol 7242. Springer, Berlin, Heidelberg


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.


RSA unravelled linearization prime difference small secret exponent 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Marián Kühnel
    • 1
  1. 1.IT Security GroupRWTH AachenGermany

Personalised recommendations