Article citationsMore>>

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

has been cited by the following article:

• TITLE: Public-Key Cryptosystems with Secret Encryptor and Digital Signature

  AUTHORS: Boris Verkhovsky

  KEYWORDS: Digital Signature; Discrete Logarithm; El Gamal Algorithm; Generator; Modular Exponentiation; Public Key Cryptosystem; Secure Communication; Sender Identification

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.6 No.1, January 29, 2013

  ABSTRACT: This paper describes and compares a variety of algorithms for secure transmission of information via open communication channels based on the discrete logarithm problem that do not require search for a generator (primitive element). Modifications that simplify the cryptosystem are proposed, and, as a result, accelerate its performance. It is shown that hiding information via exponentiation is more efficient than other seemingly simpler protocols. Some of these protocols also provide digital signature/sender identification. Numeric illustrations are provided.