On the design of rsa with short secret exponent

30Citations
Citations of this article
39Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

At Eurocrypt'99, Boneh and Durfee presented a new short secret exponent attack which improves Wiener's bound (d

Cite

CITATION STYLE

APA

Sun, H. M., Yang, W. C., & Laih, C. S. (1999). On the design of rsa with short secret exponent. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1716, pp. 150–164). Springer Verlag. https://doi.org/10.1007/978-3-540-48000-6_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free