Efficient algorithms for remainder computation and exponentiation of long numbers

Cybernetics and Systems Analysis

Volumn 32, Issue 3, 1996, Pages 437-441

  Danil'chenko, L S ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33746970495     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/BF02366510     Document Type: Article

References (7)

1. S. Maftik, Protection Mechanisms in Computer Networks [Russian translation], Mir, Moscow (1993).
2. A. V. Anisimov, "Linear Fibonacci forms and parallel algorithms in the arithmetic of long numbers," Kibernetika, No. 3, 106-115 (1995).
3. P. G. Comba, "Exponentiation cryptosystems on the IBM PC," IBM Sys. J., 29, No. 4, 526-538 (1990).
4. D. Knuth, The Art of Computer Programming [Russian translation], Vol. 2, Mir, Moscow (1977).
5. A. Aho, J. Hopcroft, and J. Ullman, The Construction and Analysis of Computer Algorithms [Russian translation], Mir, Moscow (1979).
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-323.
7. P. L. Montgomery, "Modular multiplication without trial division," Math. Comput., 44, No. 170, 519-521 (1985).