SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Computational Complexity

Volumn 1, Issue 4, 1991, Pages 360-394

Efficient and optimal exponentiation in finite fields

(1) von zur Gathen, Joachim a

a UNIVERSITY OF TORONTO (Canada)

Author keywords

Subject classifications: 68Q40, 11Y16, 12Y05

Indexed keywords

EID: 0003555072 PISSN: 10163328 EISSN: 14208954 Source Type: Journal
DOI: 10.1007/BF01212964 Document Type: Article

Times cited : (22)

References (15)

1
- 85028750412
- Fast exponentiation in GF(2ⁿ)
- C. G., Günther, Lecture Notes in Computer Science, Springer, Berlin
- (1988) Advances in Cryptology—EUROCRYPT'88 , pp. 251-255
- Agnew, G.B.¹ Mullin, R.C.² Vanstone, S.A.³

2
- 0023403892
- On the length of word chains
- (1987) Inform. Process. Lett. , vol.26 , pp. 23-28
- Berstel, J.¹ Brlek, S.²

3
- 84919719708
- Architectures for exponentiation in GF(2ⁿ)
- A. M., Odlyzko, Lecture Notes in Computer Science, Springer, Berlin
- (1986) Advances in Cryptology—CRYPTO'86 , pp. 302-310
- Beth, T.¹ Cook, B.M.² Gollmann, D.³

4
- 0024048674
- The parallel complexity of exponentiating polynomials over finite fields
- (1988) J. Assoc. Comput. Mach. , vol.35 , pp. 651-667
- Fich, F.¹ Tompa, M.²

5
- 0023431819
- Computing powers in parallel
- (1987) SIAM J. Comput. , vol.16 , pp. 930-945
- von zur Gathen, J.¹

6
- 85025490413
- Inversion in finite fields using logarithmic depth
- (1990) J. Symb. Comp. , vol.9 , pp. 175-183
- von zur Gathen, J.¹

7
- 84934183346
- J. von zur Gathen, Processor-efficient exponentiation in finite fields. Inform. Process. Lett., to appear, 1992.

8
- 84968492649
- Constructing normal bases in finite fields
- (1990) Journal of Symbolic Computation , vol.10 , pp. 547-570
- von zur Gathen, J.¹ Giesbrecht, M.²

9
- 0026124008
- Boolean circuits versus arithmetic circuits
- (1991) Inform. and Comput. , vol.91 , pp. 142-154
- von zur Gathen, J.¹ Seroussi, G.²

10
- 34250095051
- Rapid parallel calculation of degrees in a quotient ring of polynomials over a finite field
- (1987) Mathematical Notes , vol.42 , pp. 987-992
- Golovanov, P.N.¹ Solodovnikov, V.I.²

11
- 0003657590
- 2 edition, Addison-Wesley, Reading MA
- (1981) The Art of Computer Programming, Vol. 2, Seminumerical Algorithms
- Knuth, D.E.¹

12
- 84934183347
- Th. Lengauer and K. Mehlhorn, VLSI complexity, efficient VLSI algorithms and the HILL design system. In Algorithmics for VLSI, ed. C. Trullemans. Academic Press, 1986, 33–89.

13
- 77957223221
- Binary arithmetic
- (1960) Advances in computers, ed. F. L. Alt , vol.1 , pp. 231-308
- Reitwiesner, G.W.¹

14
- 0025476342
- Some observations on parallel algorithms for fast exponentiation in GF(2ⁿ)
- (1990) SIAM J. Comput. , vol.19 , pp. 711-717
- Stinson, D.R.¹

15
- 0022108239
- VLSI architectures for computing multiplications and inverses in GF(2^m)
- (1985) IEEE Trans. Comput. C , vol.34 , pp. 709-717
- Wang, C.C.¹ Truong, T.K.² Shao, H.M.³ Deutsch, L.J.⁴ Omura, J.K.⁵ Reed, I.S.⁶

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.