CryptoDB
An algorithm to obtain an RSA modulus with a large private key
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2003-11762, title={An algorithm to obtain an RSA modulus with a large private key}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / Boneh-Durfee attack, Decryption exponent, Public key cryptography, RSA cryptosystem, Wiener attack}, url={http://eprint.iacr.org/2003/045}, note={ luis@iec.csic.es 12124 received 10 Mar 2003, last revised 13 Mar 2003}, author={L. Hernández Encinas and J. Munoz Masque and A. Queiruga Dios}, year=2003 }