Comparison and Performance Evaluation of Prime Number Generation Using Sieves Algorithm

Abstract

People are used prime numbers in secret codes to secure the message and data. Prime numbers are essential in computer security problem to perform certain operations over the Internet. It can be used for encryption. The larger the prime number used, the intricate it is to decipher the code. So finding the “massive” prime number is a current problem. One of the most widely used applications of prime number in computing is the RSA encryption system. A prime sieve is a fast type of algorithm for finding prime numbers. Sieve of Eratosthenes, Sieve of Sundaram and Sieve of Atkins are the algorithms that can be used to generate prime numbers. This research paper is to study and testing to find out, which algorithm is better used for large prime numbers in terms of time complexity. The prime sieve algorithm is coded in java language and the results are summarized.