B. Verkhovsky, “Multiplicative Inverse Algorithm and Its Space Complexity”, Annals of European Academy of Sciences, 2004, pp. 110-124.

has been cited by the following article:

• TITLE: Faster Method for Secure Transmission of Information with Sender Identification

  AUTHORS: Boris Verkhovsky

  KEYWORDS: Digital Signature; RSA Algorithm; Diffie-Hellman Key Exchange; ElGamal Cryptosystem; Encryptor; Discrete Logarithm; Sender Identification; Multiplicative Inverse

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.6 No.2, February 26, 2013

  ABSTRACT: This paper describes an algorithm for secure transmission of information via open communication channels based on the discrete logarithm problem. The proposed algorithm also provides sender identification (digital signature). It is twice as fast as the RSA algorithm and requires fifty per cent fewer exponentiations than the ElGamal cryptosystems. In addition, the algorithm requires twice less bandwidth than the ElGamal algorithm. Numerical examples illustrate all steps of the proposed algorithm: system design (selection of private and public keys), encryption, transmission of information, decryption and information recovery.