메뉴 건너뛰기




Volumn 1717, Issue , 1999, Pages 269-279

Highly regular architectures for finite field computation using redundant basis

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ECONOMIC AND SOCIAL EFFECTS;

EID: 84949519804     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48059-5_23     Document Type: Conference Paper
Times cited : (16)

References (19)
  • 4
    • 0000895310 scopus 로고    scopus 로고
    • A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits
    • m) Yielding Small Complexity Arithmetic Circuits. IEEE Trans. Comput. 47(1998)
    • (1998) IEEE Trans. Comput , vol.47
    • Drolet, G.1
  • 5
    • 0024750016 scopus 로고
    • A VLSI architecture for fast inversion in GF(2m)
    • m). IEEE Trans. Comput. 38(1989) 1383-1386
    • (1989) IEEE Trans. Comput , vol.38 , pp. 1383-1386
    • Feng, M.1
  • 7
    • 84968467386 scopus 로고
    • On orders of optimal normal basis generators
    • Gao, S., Vanstone, S.A.: On orders of optimal normal basis generators. Math. Comp. 64(1995) 1227-1233
    • (1995) Math. Comp , vol.64 , pp. 1227-1233
    • Gao, S.1    Vanstone, S.A.2
  • 9
    • 0001492981 scopus 로고
    • A modified Massey-Omura parallel multiplier for a class of finite fields
    • Hasan, M.A., Wang, M., Bhargava, V.K.: A modified Massey-Omura parallel multiplier for a class of finite fields. IEEE Trans. Comput. 42(1993) 1278-1280
    • (1993) IEEE Trans. Comput , vol.42 , pp. 1278-1280
    • Hasan, M.A.1    Wang, M.2    Bhargava, V.K.3
  • 10
    • 0000827611 scopus 로고
    • A fast algorithm for computing multiplicative inverse in GF(2m) using normal bases
    • m) using normal bases. Inform. and Comput. 78(1988) 171-177
    • (1988) Inform. And Comput , vol.78 , pp. 171-177
    • Itoh, T.1    Tsujii, S.2
  • 11
    • 0032023646 scopus 로고    scopus 로고
    • Low-complexity bit-parallel canonical and normal multipliers for a class of finite fields
    • Koc, C.K., Sunar, B.: Low-complexity bit-parallel canonical and normal multipliers for a class of finite fields. IEEE Trans. Comput. 47(1998) 353-356
    • (1998) IEEE Trans. Comput , vol.47 , pp. 353-356
    • Koc, C.K.1    Sunar, B.2
  • 12
    • 84949483978 scopus 로고    scopus 로고
    • Lidl, R., Niederreiter, H.: Finite Fields. Addison-Wesley Publishing Company, 1983, Reading, MA
    • Lidl, R.1    Niederreiter, H.2
  • 17
    • 0022108239 scopus 로고
    • VLSI architectures for computing multiplications and inverses in GF(2m)
    • m). IEEE Trans. Comput. 34(1985) 709-717
    • (1985) IEEE Trans. Comput , vol.34 , pp. 709-717
    • Wang, C.C.1
  • 18
    • 84949502439 scopus 로고    scopus 로고
    • Wassermann, A.: Konstruktion von Normalbasen. Bayreuther Mathematische Schriften 31(1990) 155-164
    • Wassermann, A.1
  • 19
    • 0000287156 scopus 로고    scopus 로고
    • Low complexity bit-parallel multipliers for a class of finite fields
    • Wu, H., Hasan, M.A.: Low complexity bit-parallel multipliers for a class of finite fields. IEEE Trans. Comput. 47(1998) 883-887
    • (1998) IEEE Trans. Comput , vol.47 , pp. 883-887
    • Wu, H.1    Hasan, M.A.2


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