On the Number of Sparse RSA Exponents
β
William D. Banks; Igor E. Shparlinski
π
Article
π
2002
π
Elsevier Science
π
English
β 109 KB
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; jΓ°MΓΓ ΒΌ 1 (hence RSA decryption can also be performed) is very close to the expected value.