N. DeBruijn. On the number of uncancelled elements in the sieve of eratosthenes. Proc. Neder. Akad., 53:803--812, 1950. Reviewed in Leveque Reviews in Number Theory, Vol. 4, Section N-28, p. 221. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Two Party RSA Key Generation - Gilboa (1999) (20 citations) (Correct)
....section 6. We leave the details to the full version of the paper. 8 Performance The most resource consuming part of our protocol, in terms of computation and communication, is the computation of N together with trial divisions. We use trial divisions because of the following result by DeBruijn [10]. If a random oe=2 bit integer passes the trial divisions for all primes less than B then asymptotically: Pr[p prime j p 6j 0 mod p i ; 8p i B] 5:14 lnB oe (1 o( 2 oe ) We focus on the performance of the more efficient version of our protocol, using homomorphic encryption. We also ....
N. DeBruijn. On the number of uncancelled elements in the sieve of eratosthenes. Proc. Neder. Akad., 53:803--812, 1950. Reviewed in Leveque Reviews in Number Theory, Vol. 4, Section N-28, p. 221.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC