Aspect of Prime Numbers in Public Key Cryptosystem
Huma Galzie, Kazi Arif Hossain · 2005
The secrecy of Public Key cryptosystem relies heavily on the intractability of various mathematical problems. As a result numbers and their complexities play a very important role in keeping the system secure. Prime numbers are of the greatest importance here due to their widespread use in encryption algorithms such as the RSA algorithm. For example, if there were efficient algorithms for factoring large numbers, the vast majority of encrypted electronic communications worldwide would be easily crackable. In most of the public key algorithms large prime numbers (100 decimal digits) have been used as a means of securing the system. In this paper we deal with the subject of handling prime numbers efficiently in cryptosystems and give an overview of certain efficient primality tests. We hope it’s a new look to the prime numbers.