On the Design of RSA with Short Secret Exponent [chapter]

Hung-Min Sun, Wu-Chuan Yang, Chi-Sung Laih
1999 Lecture Notes in Computer Science  
Based on continued fractions Wiener showed that a typical RSA system can be totally broken if its secret exponent d < constant, e.g., 112. Compared with a typical RSA system in which e is the same order of magnitude as N if d is first selected, these variants of RSA have the advantage that the overall computation can be significantly reduced. As an example, we can construct a secure RSA system with p of 256 bits, q of 768 bits, d of 256 bits, and e of 880 bits.
doi:10.1007/978-3-540-48000-6_13 fatcat:k4rahko5dbgxlhyrvd4rr2g5xq