Cybernetics and Systems Analysis

, Volume 32, Issue 3, pp 437–441 | Cite as

Efficient algorithms for remainder computation and exponentiation of long numbers

  • L. S. Danil'chenko
Systems Analysis


Operating System Artificial Intelligence System Theory Efficient Algorithm Remainder Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Maftik, Protection Mechanisms in Computer Networks [Russian translation], Mir, Moscow (1993).Google Scholar
  2. 2.
    A. V. Anisimov, “Linear Fibonacci forms and parallel algorithms in the arithmetic of long numbers,” Kibernetika, No. 3, 106–115 (1995).MATHMathSciNetGoogle Scholar
  3. 3.
    P. G. Comba, “Exponentiation cryptosystems on the IBM PC,” IBM Sys. J.,29, No. 4, 526–538 (1990).Google Scholar
  4. 4.
    D. Knuth, The Art of Computer Programming [Russian translation], Vol. 2, Mir, Moscow (1977).Google Scholar
  5. 5.
    A. Aho, J. Hopcroft, and J. Ullman, The Construction and Analysis of Computer Algorithms [Russian translation], Mir, Moscow (1979).Google Scholar
  6. 6.
    P. Barrett, “Implementing the Rivest, Shamir, and Adleman public key encryption algorithm on a standard digital signal processors,” in: Proc. Adv. Cryptology CRYPTO '86. Springer, Berlin (1987), pp. 311–323Google Scholar
  7. 7.
    P. L. Montgomery, “Modular multiplication without trial division,” Math. Comput.44, No. 170, 519–521 (1985).MATHGoogle Scholar

Copyright information

© Plenum Publishing Corporation 1996

Authors and Affiliations

  • L. S. Danil'chenko

There are no affiliations available

Personalised recommendations