A. L. Toom, “The Complexity of a Scheme of Functional Elements Realizing the Multiplication of Integers,” Soviet Mathematics Doklady, No. 3, 1963, pp. 714-716.

has been cited by the following article:

• TITLE: Double-Moduli Gaussian Encryption/Decryption with Primary Residues and Secret Controls

  AUTHORS: Boris S. Verkhovsky

  KEYWORDS: ambiguity-free information recovery, complex modulus, cryptosystem design, cycling identity, information hiding, plaintext preconditioning, primary residue, public-key cryptography, secret controls, threshold parameters

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.4 No.7, July 25, 2011

  ABSTRACT: In this paper an encryption-decryption algorithm based on two moduli is described: one in the real field of integers and another in the field of complex integers. Also the proper selection of cryptographic system parameters is described. Several numeric illustrations explain step-by-step how to precondition a plaintext, how to select secret control parameters, how to ensure feasibility of all private keys and how to avoid ambiguity in the process of information recovery. The proposed cryptographic system is faster than most of known public key cryptosystems, since it requires a small number of multiplications and additions, and does not require exponentiations for its implementation.