On the Number of Sparse RSA Exponents
Banks, William David, 1964-
Shparlinski, Igor E.
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,φ(M)) = 1 (hence RSA decryption can also be performed) is very close to the expected value.
Mathematics publications (MU)