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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boneh, D., Durfee, G.: Cryptanalysis of RSA with Private Key d Less than N 0.292. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 1–11. Springer, Heidelberg (1999)
Blömer, J., May, A.: A Generalized Wiener Attack on RSA. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 1–13. Springer, Heidelberg (2004)
Blömer, J., May, A.: Low Secret Exponent RSA Revisited. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 4–19. Springer, Heidelberg (2001)
Coppersmith, D.: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. Journal of Cryptology 10(4), 233–260 (1997)
Herrmann, M., May, A.: Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much? In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 487–504. Springer, Heidelberg (2009)
Herrmann, M., May, A.: Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 53–69. Springer, Heidelberg (2010)
Howgrave-Graham, N.: Finding Small Roots of Univariete Modular Equations Revisited. In: Möhring, R.H. (ed.) WG 1997. LNCS, vol. 1335, pp. 131–142. Springer, Heidelberg (1997)
Lenstra, A.K., Hendrik, Lovász, L.: Factoring Polynomials with Rationals Coefficients. Mathematische Annalen 261(4), 515–534 (1982)
McKee, J.: Speeding Fermat’s Factoring Method. Math. Comput. 68, 1729–1737 (1999)
The PARI Group, Bordeaux: PARI//GP, version 2.5.0 (2011), http://pari.math.u-bordeaux.fr
Shoup, V.: NTL: A Library for Doing Number Theory (2003), http://www.shoup.net/ntl
Schnorr, C.P.: Block Korkin-Zolotarev Bases and Succesiva Minima (1996)
Wiener, M.: Cryptanalysis of Short RSA Secret Exponents. IEEE Transactions on Information Theory 36, 553–558 (1990)
De Weger, B.: Cryptanalysis of RSA with Small Prime Difference, Applicable Algebra in Engineering. Communication and Computing 13(1), 17–28 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-34159-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-34159-5_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34158-8
Online ISBN: 978-3-642-34159-5
eBook Packages: Computer ScienceComputer Science (R0)