This paper introduces an extension of Rabin cryptosystem into the domain of complex integers. The extended cryptosystem employs a new square root algorithm for complex integers that is presented. The extended Rabin cryptosystem is efficient, provably secure and has certain advantages over the real-integer Rabin cryptosystem.
Index Terms:
Cryptography, Gaussian integers, RSA, Rabin algorithm, extraction of square roots, complex integers, Gaussian primes
Citation:
Aleksey Koval, Boris S. Verkhovsky, "Cryptosystem Based on Extraction of Square Roots of Complex Integers," itng, pp.1190-1191, Fifth International Conference on Information Technology: New Generations (itng 2008), 2008