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

L.  Hernández Encinas; J.  Muñoz Masqué; A.  Queiruga Dios

Paper 2003/045

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

L. Hernández Encinas, J. Muñoz Masqué, 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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Boneh-Durfee attack Decryption exponent Public key cryptography RSA cryptosystem Wiener attack
Contact author(s): luis @ iec csic es
History: 2003-03-13: revised; 2003-03-13: received; See all versions
Short URL: https://ia.cr/2003/045
License: CC BY

BibTeX

@misc{cryptoeprint:2003/045,
      author = {L.  Hernández Encinas and J.  Muñoz Masqué and A.  Queiruga Dios},
      title = {An algorithm to obtain an RSA modulus with a large private key},
      howpublished = {Cryptology ePrint Archive, Paper 2003/045},
      year = {2003},
      note = {\url{https://eprint.iacr.org/2003/045}},
      url = {https://eprint.iacr.org/2003/045}
}