Are 'Strong' Primes Needed for RSA

@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}
}
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