Security Key generation using RSA Algorithm

Abstract

Prime numbers are fundamental parts of cryptography and communication systems in general. Prime numbers are being used more and more for encryption and decryption purposes. RSA keys use prime numbers. Many algorithms and techniques are available and implemented to generate prime numbers efficiently. The length of prime numbers extends up to 200 bits in cryptography for security concerns. There is a need for electronic hardware that can detect and tell if a number given to it as input is prime or not in minimum time and using minimum hardware for faster transfer of data in the communication system. A simple algorithm for detecting prime numbers is presented in this paper which takes 53.023ns and 9143 LUTs for detecting a prime number whereas papers considered for literature were consuming 5.5ms for generating 128-bit prime numbers using minimum process time algorithm.