Primality Testing Using Complex Integers and Pythagorean Triplets

HTML  Download Download as PDF (Size: 95KB)  PP. 513-519  
DOI: 10.4236/ijcns.2012.59062    4,387 Downloads   6,671 Views  
Author(s)

ABSTRACT

Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design stage of a cryptographic system is a formidable task. Fermat primality checking is one of the simplest of all tests. Unfortunately, there are composite integers (called Carmichael numbers) that are not detectable by the Fermat test. In this paper we consider modular arithmetic based on complex integers; and provide several tests that verify the primality of real integers. Although the new tests detect most Carmichael numbers, there are a small percentage of them that escape these tests.

Share and Cite:

B. Verkhovsky, "Primality Testing Using Complex Integers and Pythagorean Triplets," International Journal of Communications, Network and System Sciences, Vol. 5 No. 9, 2012, pp. 513-519. doi: 10.4236/ijcns.2012.59062.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.