## How to Choose Secret Parameters for RSA and its Extensions to Elliptic Curves [ Published in Designs , Codes and Cryptography

- Marc Joye, Jean-Jacques Quisquater, Tsuyoshi Takagi
- 2001

Highly Influenced

@article{Rivest2001AreP, title={Are 'Strong' Primes Needed for RSA}, author={Ronald L. Rivest and Robert Silverman}, journal={IACR Cryptology ePrint Archive}, year={2001}, volume={2001}, pages={7} }

- Published 2001 in IACR Cryptology ePrint Archive

We review the arguments in favor of using so called strong primes in the RSA public key cryptosystem There are two types of such arguments those that say that strong primes are needed to protect against factoring attacks and those that say that strong primes are needed to protect against cycling attacks based on repeated encryption We argue that contrary to common belief it is unnecessary to use strong primes in the RSA cryptosystem That is by using strong primes one gains a negligible increaseâ€¦Â CONTINUE READING

Highly Cited

This paper has 49 citations. REVIEW CITATIONS