[Resource Topic] 2003/045: An algorithm to obtain an RSA modulus with a large private key

Welcome to the resource topic for 2003/045

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

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

ePrint: https://eprint.iacr.org/2003/045

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .