Abstract

This survey paper is based on prime numbers and primality test. Prime numbers are building block of number theory. Prime numbers play a vital role in number theory, there applications are mostly found in cryptography. It is very difficult to find whether a number is prime or not whenever the number is too big. To overcome this problem there are various algorithms. This paper is written in context of prime numbers that explains about prime and some of their testing methods like Fermat’s primality test, AKS Algorithm, Chinese primality test and also the Lucas test.

Keywords: Prime numbers, Number theory, Cryptography, Algorithms