• Vibhor Sharma
• Lokesh Kumar
• Deepak Arya
• Sakendra Kumar
• Mohit Payal

The current era of cryptography represents an issue of creating large prime numbers to carry out the implementation process of the asymmetric cryptographic scheme such as Diffie-Hellman key exchange, RSA, digital signature algorithm etc. For the purpose of large prime number generation, a large amount of processing resources is necessary. So, substantial amount of resources are considered in different kind of systems. In a general process of producing prime number, the process begins from the generation of a random number. A probable test of primality is applied on that generated random number which is observed as a prime number provisionally and then put in to an asymmetric cryptographic system. In that kind of primality tests, there are the requirements of several numerical functions. That is the reason behind the slow process of the mentioned asymmetric cryptographic algorithms. In this paper, we introduced a new technique of generating prime number based on genetic algorithm which may be beneficial in producing large prime numbers efficiently and effectively to make it more probable. We tried to overcome the randomness of prime number generation algorithms by introducing GA based approach so that we could generate prime numbers with high probability in less time.

Prime Number Production, Encryption, Fitness Function, Selection, Crossover Function, Mutation

"A Novel Approach for Producing Large Primes for Asymmetric Key Cryptographic Algorithms", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 1, page no.839-843, January-2019, Available :http://www.jetir.org/papers/JETIR1901H15.pdf

"A Novel Approach for Producing Large Primes for Asymmetric Key Cryptographic Algorithms", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 1, page no. pp839-843, January-2019, Available at : http://www.jetir.org/papers/JETIR1901H15.pdf