B. Verkhovsky, “Enhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Cryptographic Application,” International Journal of Communications, Network and System Sciences, Vol. 3, No. 12, 2010, pp. 901-906. doi:10.4236/ijcns.2010.312123

has been cited by the following article:

• TITLE: Information Protection Based on Extraction of Square Roots of Gaussian Integers

  AUTHORS: Boris S. Verkhovsky

  KEYWORDS: Public Key Cryptosystems, Square-Root Extraction, Gaussian Integers, Gaussian Generator, Multiplicative Inverse, Square Root Algorithm, Information Hiding, Ambiguity of Recovery

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.4 No.3, March 10, 2011

  ABSTRACT: A cryptosystem based on computation of square roots of complex integers modulo composite n is described in this paper. This paper provides an algorithm extracting a square root of Gaussian integer. Various properties of square roots and a method for finding Gaussian generators are demonstrated. The generators can be instrumental in constructing other cryptosystems. It is shown how to significantly reduce average complexity of decryption per each block of ciphertext.