Are `Strong' Primes Needed for RSA? (1999)
Cached
Download Links
by
Ronald L. Rivest
,
Robert D. Silverman
| Venue: | In The 1997 RSA Laboratories Seminar Series, Seminars Proceedings |
| Citations: | 5 - 1 self |
BibTeX
@INPROCEEDINGS{Rivest99are`strong',
author = {Ronald L. Rivest and Robert D. Silverman},
title = {Are `Strong' Primes Needed for RSA?},
booktitle = {In The 1997 RSA Laboratories Seminar Series, Seminars Proceedings},
year = {1999},
pages = {accepted.}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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).
