Abstract
We show that for low public exponent rsa, given a quarter of the bits of the private key an adversary can recover the entire private key. Similar results (though not as strong) are obtained for larger values of e. For instance, when e is a prime in the range [N1/4, N1/2], half the bits of the private key suffice to reconstruct the entire private key. Our results point out the danger of partial key exposure in the rsa public key system.
Chapter PDF
Similar content being viewed by others
References
D. Coppersmith, “Finding a small root of a univariate modular equation„, Proc. of Eurocrypt’ 96, pp. 155–165.
T. ElGamal, “A public key cryptosystem and a signature scheme based on the discrete logarithm„, IEEE Transactions on Information Theory, 31(4):469–472, 1985.
P. Kocher, “Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems„, Proc. of Cyrpto 96, pp. 104–113.
A. K. Lenstra, H. W. Lenstra, L. Lovász, “Factoring Polynomials with Rational Coefficients„, Mathematische Annalen, vol. 261, no. 4, 1982, pp. 515–534.
J.J. Quisquater, private communications.
R. L. Rivest, A. Shamir, and L. Adleman. “A method for obtaining digital signatures and public-key cryptosystems.„ Communications of the ACM 21(2):120–126, Feb. 1978.
M. Wiener, “Cryptanalysis of short RSA secret exponents„, IEEE Transactions on Info. Th., Vol. 36, No. 3, 1990, pp. 553–558.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boneh, D., Durfee, G., Frankel, Y. (1998). An Attack on RSA Given a Small Fraction of the Private Key Bits. In: Ohta, K., Pei, D. (eds) Advances in Cryptology — ASIACRYPT’98. ASIACRYPT 1998. Lecture Notes in Computer Science, vol 1514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49649-1_3
Download citation
DOI: https://doi.org/10.1007/3-540-49649-1_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65109-3
Online ISBN: 978-3-540-49649-6
eBook Packages: Springer Book Archive