On the Number of Sparse RSA Exponents

MOspace/Manakin Repository

Breadcrumbs Navigation

On the Number of Sparse RSA Exponents

Please use this identifier to cite or link to this item: http://hdl.handle.net/10355/10626

[+] show full item record


Title: On the Number of Sparse RSA Exponents
Author: Banks, William David, 1964-; Shparlinski, Igor E.
Keywords: sum of digits
modular exponentiation
public key cryptosystem
asymmetric key algorithms
Date: 2002
Abstract: 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.
URI: http://hdl.handle.net/10355/10626

This item appears in the following Collection(s)

  • Mathematics publications (MU) [119]
    The items in this collection are the scholarly output of the faculty, staff, and students of the Department of Mathematics.

[+] show full item record