Results 1 
1 of
1
Sieve Methods
"... called undeniable signature schemes require prime numbers of the form 2p 1 such that p is also prime. Sieve methods can yield valuable clues about these distributions and hence allow us to bound the running times of these algorithms. In this treatise we survey the major sieve methods and their i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
called undeniable signature schemes require prime numbers of the form 2p 1 such that p is also prime. Sieve methods can yield valuable clues about these distributions and hence allow us to bound the running times of these algorithms. In this treatise we survey the major sieve methods and their important applications in number theory. We apply sieves to study the distribution of squarefree numbers, smooth numbers, and prime numbers. The first chapter is a discussion of the basic sieve formulation of Legendre. We show that the distribution of squarefree numbers can be deduced using a squarefree sieve 1 . We give an account of improvements in the error term of this distribution, using known results regarding the Riemann Zeta function. The second chapter deals with Brun's Combinatorial sieve as presented in the modern language of [HR74]. We apply the general sieve to give a simpler