On the number of sparse RSA exponents

William D. Banks*, Igor E. Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


An RSA modulus is a product M = pl of two primes p and l. We show that for almost all RSA moduli M, the number of sparse exponents e (which allow for fast RSA encryption) with the property that gcd(e,O (M)) = 1 (hence RSA decryption can also be performed) is very close to the expected value.

Original languageEnglish
Pages (from-to)340-350
Number of pages11
JournalJournal of Number Theory
Issue number2
Publication statusPublished - Aug 2002


Dive into the research topics of 'On the number of sparse RSA exponents'. Together they form a unique fingerprint.

Cite this