A Comparative Analysis of General, Sieve-of-Eratosthenes and Rabin-Miller Approach for Prime Number Generation

Abstract

Selecting efficient algorithm for generating prime numbers is necessary for various purposes such as encryption, cryptography, generating complex passwords, system verification and for other computational purposes. Various approaches from efficiency improvement over rudimentary algorithms to using complex algorithms for finding necessary prime number have commonly been used depending on overall use. Problems sometimes occur for choosing a particular approach for specific use. Certain algorithms perform better than others such as sieve of atkins or sieve of eratosthenes. Comparisons over different algorithms has been made to choose more efficient ones. Here, this problem over choosing a suitable algorithm for generating prime number has been addressed.