We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
An Analysis of Some Prime Generating Sieves.
- Authors
Chakrabarty, Alok; Purkayastha, Bipul Syam
- Abstract
Prime number generation is vital to prime factorization and primality testing, and is also used for generating random numbers. Prime number generation gives a better understanding of the fascinating nature of prime numbers which helps to generate large primes which are used in public key cryptosystems for e-security. Further, prime number generation involves heavy number crunching, thus it is also used as a benchmark for comparing the hardware performance and the capabilities of compilers. Prime number generation programs are among the choicest programs for demonstrating programming basics to beginners. The present paper thus discusses some commonly used techniques of generating prime numbers employing the sieve theory. It begins with the famous Sieve of Eratosthenes (SoE) and discusses some of its efficient extensions. The paper also provides an overview of the Pritchard's wheel sieve technique. Finally we provide a comparative complexity analysis of the SoE and its quoted extensions.
- Subjects
PRIME numbers; RANDOM numbers; FACTOR tables; FACTORIZATION; COMPUTER security
- Publication
IUP Journal of Computer Sciences, 2010, Vol 4, Issue 1, p16
- ISSN
2583-441X
- Publication type
Article