O(n)-depth modular exponentiation circuit algorithm

IEEE Transactions on Computers

Volumn 46, Issue 6, 1997, Pages 701-704

  Hamano, Takafumi ^b   Takagi, Naofumi ^a,c   Yajima, Shuzo ^a,d   Preparata, Franco P ^a,e  

^a IEEE   (Japan)

^b NTT CORPORATION   (Japan)

^c NAGOYA UNIVERSITY   (Japan)

^d KYOTO UNIVERSITY   (Japan)

^e Brown Univerity   (United States)

Author keywords

Circuit complexity; Computer arithmetic; Hardware algorithm; Modular arithmetic; Modular exponentiation

Indexed keywords

EID: 33747105244     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.600828     Document Type: Article

References (10)

1. R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signature and Public-Key Cryptosystems," Comm. ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
2. D.E. Knuth, The Art of Computer Programming, vol. 2, Seminumerical Algorithms, second edition, section 4.6.3. Addison-Wesley, 1981.
3. E.F. Brickell, "A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography," Advances in Cryptology: Proc. CRYPTO 82, D. Chaum et al., eds., pp. 51-60. Plenum, 1983.
4. P.L. Montgomery, "Modular Multiplication without Trial Division," Math. Computation, vol. 44, no. 170, pp. 519-521, Apr. 1985.
5. P.W. Beame, S.A. Cook, and H.J. Hoover, "Log Depth Circuits for Division and Related Problems," Proc. 25th IEEE FOCS, pp. 1-6, Oct. 1984.
6. Y. Okabe, N. Takagi, and S. Yajima, "Log Depth Circuits for Elementary Functions Using Residue Number System," IEICE Trans., vol. J73-D-I, no. 9, pp. 723-728, Sept. 1990 (in Japanese).
7. English translated version is available in Electronics and Comm. in Japan, part 3, vol. 74, no. 8, pp. 31-38, 1991.
8. 1+ε)," Information and Computation, vol. 72., pp. 270-282, 1987.
9. N.S. Szavo and R.I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology. McGraw-Hill, 1967.
10. J. von zur Gathen, "Computing Powersin Parallel," SIAM J. Computing, vol. 16, no. 5, pp. 930-945, Oct. 1987.