Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
An Improved Divisibility Test Algorithm for Primality Testing
verfasst von : Arjun Kumar, TaeYong Kim, HoonJae Lee
Erschienen in: Ubiquitous Information Technologies and Applications
Verlag: Springer Netherlands
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Security 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.