✦ LIBER ✦

On the Number of Sparse RSA Exponents

✍ Scribed by William D. Banks; Igor E. Shparlinski

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 109 KB
Volume: 95
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.2001.2775

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

The Exact Exponent of Sparse Grid Quadra

The Exact Exponent of Sparse Grid Quadratures in the Weighted Case

✍ Leszek Plaskota; Grzegorz W. Wasilkowski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 111 KB

This paper provides a lower bound on the exponent of tractability for Sparse Grid Quadratures for multivariate integration of functions from a certain class of weighted tensor product spaces. This lower bound is sharp since it matches a corresponding upper bound of G. W. Wasilkowski and H. Woz ´niak

The number of connected sparsely edged g

The number of connected sparsely edged graphs

✍ E. M. Wright 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^n−2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp

The number of connected sparsely edged g

The number of connected sparsely edged graphs. III. Asymptotic results

✍ E. M. Wright 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

## Abstract The number of connected graphs on __n__ labeled points and __q__ lines (no loops, no multiple lines) is __f(n,q).__ In the first paper of this series I showed how to find an (increasingly complicated) exact formula for __f(n,n+k)__ for general __n__ and successive __k.__ The method woul

On the Complexity of Sparse Elimination

✍ Ioannis Z. Emiris 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the decay exponent of isotropic turbu

On the decay exponent of isotropic turbulence

✍ M. Oberlack 📂 Article 📅 2002 🏛 John Wiley and Sons ⚖ 138 KB 👁 1 views

## On the decay exponent of isotropic turbulence It has long been observed that after a short initial transient period of time the decay of the velocity fluctuations u 2 of high Reynolds number homogeneous isotropic turbulence follows closely the algebraic law u 2 ∼ t -n . From experiments and DNS

Wright's formulae for the number of conn

Wright's formulae for the number of connected sparsely edged graphs

✍ P. M. D. Gray; A. M. Murray; N. A. Young 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB

## Abstract We have written computer programs to determine exactly the coefficients in Wright's formula for __f(n, n + k)__, the number of connected sparsely edged labeled graphs (see preceding paper), and used them up to __k__ = 24. We give the results up to __k__ = 7.