Cryptosystem based on extraction of square roots of complex integers

Proceedings - International Conference on Information Technology: New Generations, ITNG 2008

Volumn , Issue , 2008, Pages 1190-1191

  Verkhovsky, Boris S ^a   Koval, Aleksey ^a  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Complex integers; Cryptography; Extraction of square roots; Gaussian integers; Gaussian primes; Rabin algorithm; RSA

Indexed keywords

COMPLEX INTEGERS; EXTRACTION OF SQUARE ROOTS; GAUSSIAN INTEGERS; GAUSSIAN PRIMES; RABIN ALGORITHM;

ALGORITHMS; CRYPTOGRAPHY; GAUSSIAN DISTRIBUTION;

INTEGER PROGRAMMING;

EID: 44049096272     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2008.107     Document Type: Conference Paper

References (5)

1. J.T. Cross, "The Euler's ø-function in the Gaussian integers", Amer. Math., 55, 1983, 518-528.
2. H. Elkamchouchi, K. Elshenawy, and H. Shaban, "Extended RSA cryptosystem and digital signature schemes in the domain of Gaussian integers", Communication Systems, 2002. ICCS 2002. The 8th International Conference, Vol. 1, 91-95.
3. A. N. El-Kassar, M. Rizk, N. Mirza, and Y. Awad, "ElGamal public key cryptosystem in the domain of Gaussian integers", International Journal of Applied Mathematics, 2001, Vol. 7, No. 4, 405-412.
4. M. O. Rabin, "Digitalized signatures and public key functions as intractable as factorization", Technical Report MIT/LCS/TR-212, MIT Laboratory for Computer Science, Jan. 1979.
5. B. Verkhovsky, "Enhanced Euclid algorithm for modular multiplicative inverse and its complexity", Advances in Computer Cybernetics, Vol. VI, 1999, 51-57.