Sciweavers

CRYPTO
2007
Springer
154views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
Wiener’s famous attack on RSA with d < N0.25 shows that using a small d for an efficient decryption process makes RSA completely insecure. As an alternative, Wiener proposed t...
Ellen Jochemsz, Alexander May