On the number of sparse RSA exponents

William D. Banks; Igor E. Shparlinski

doi:10.1016/S0022-314X(01)92775-1

On the number of sparse RSA exponents

William D. Banks^*, Igor E. Shparlinski

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

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,O (M)) = 1 (hence RSA decryption can also be performed) is very close to the expected value.

Original language	English
Pages (from-to)	340-350
Number of pages	11
Journal	Journal of Number Theory
Volume	95
Issue number	2
DOIs	https://doi.org/10.1016/S0022-314X(01)92775-1
Publication status	Published - Aug 2002

Access to Document

10.1016/S0022-314X(01)92775-1

Cite this

@article{3cb07e9992824294918e909cb18c16cf,

title = "On the number of sparse RSA exponents",

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,O (M)) = 1 (hence RSA decryption can also be performed) is very close to the expected value.",

author = "Banks, {William D.} and Shparlinski, {Igor E.}",

year = "2002",

month = aug,

doi = "10.1016/S0022-314X(01)92775-1",

language = "English",

volume = "95",

pages = "340--350",

journal = "Journal of Number Theory",

issn = "0022-314X",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - On the number of sparse RSA exponents

AU - Banks, William D.

AU - Shparlinski, Igor E.

PY - 2002/8

Y1 - 2002/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036695932&partnerID=8YFLogxK

U2 - 10.1016/S0022-314X(01)92775-1

DO - 10.1016/S0022-314X(01)92775-1

M3 - Article

AN - SCOPUS:0036695932

VL - 95

SP - 340

EP - 350

JO - Journal of Number Theory

JF - Journal of Number Theory

SN - 0022-314X

IS - 2

ER -

On the number of sparse RSA exponents

Abstract

Access to Document

Other files and links

Fingerprint

Cite this