Cryptology ePrint Archive: Report 2003/045

An algorithm to obtain an RSA modulus with a large private key

L. Hern\'{a}ndez Encinas and J. Mu\~{n}oz Masqu\'{e} and A. Queiruga Dios

Abstract: Sufficient conditions are obtained on the prime factors of an RSA modulus in order to avoid Wiener and Boneh-Durfee attacks. The public exponent can be chosen arbitrarily.

Category / Keywords: public-key cryptography / Boneh-Durfee attack, Decryption exponent, Public key cryptography, RSA cryptosystem, Wiener attack

Date: received 10 Mar 2003, last revised 13 Mar 2003

Contact author: luis at iec csic es

Available formats: PDF | BibTeX Citation

Version: 20030313:175329 (All versions of this report)

Discussion forum: Show discussion | Start new discussion