Abstract
AbstractSecurity of information is a major concern now a days in the world. Cryptography plays a major role in ensuring the safety of the information that is being transferred over the internet or any unsecure medium. Prime Numbers are very important aspect of any Cryptographic System and play a major role in ensuring the safety of the concerned Cryptographic System. Currently there are various algorithms used for checking that a particular number is a prime or not. Few of the commonly used algorithms are Divisibility Test, Fermat Test, and Chinese Primality Test etc. This paper proposes an enhancement in the Divisibility Primality Testing algorithm that reduces the number of comparisons to be made and thus enhancing the performance of the algorithm. In addition to this the pseudo code and implementation code of the improved algorithm are provided in detail. An analysis and comparison of the existing algorithm and the enhanced algorithm is also presented in the given paper.KeywordsPrimality testingPrime numbersDivisibility primality testing algorithm
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
