Efficient normal basis multipliers in composite fields

被引：0
|
作者：
Oh, S
Kim, CH
Lim, J
Cheon, DH
机构：
[1] Korea Univ, Ctr Informat Secur Technol, Seoul 136701, South Korea
[2] Semyung Univ, Dept Comp Aided Math Informat Sci, Jecheon 390711, Chungbuk, South Korea
来源：
IEEE TRANSACTIONS ON COMPUTERS | 2000年 / 49卷 / 10期
关键词：
finite field; composite field; optimal normal basis; bit-parallel multiplier;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
It is well-known that a class of finite fields GF(2(n)) using an optimal normal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardware-applicable properties resulting from the normal basis representation and the optimal condition. We also present a hardware architecture of the proposed composite fields including a hit-parallel multiplier.
引用
收藏
页码：1133 / 1138
页数：6
相关论文
共 50 条
  • [1] Efficient normal basis multipliers in composite fields
    Oh, Sangho
    Kim, Chang Han
    Lim, Jongin
    Cheon, Dong Hyeon
    2000, IEEE, Los Alamitos, CA, United States (49)
  • [2] Efficient Bit-Parallel Multipliers in Composite Fields
    Lee, Chiou-Yng
    Meher, Pramod Kumar
    2008 IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE, VOLS 1-3, PROCEEDINGS, 2008, : 686 - +
  • [3] Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF(2m) generated by AOPs
    Imaña, JL
    Sánchez, JM
    JOURNAL OF VLSI SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2006, 42 (03): : 285 - 296
  • [4] Efficient Reconfigurable Implementation of Canonical and Normal Basis Multipliers Over Galois Fields GF(2m) Generated by AOPs
    J.L. Imaña
    J.M. Sánchez
    Journal of VLSI signal processing systems for signal, image and video technology, 2006, 42 : 285 - 296
  • [5] An efficient basis conversion algorithm for composite fields with given representations
    Sunar, B
    IEEE TRANSACTIONS ON COMPUTERS, 2005, 54 (08) : 992 - 997
  • [6] Efficient digit-serial normal basis multipliers over GF(2M)
    Reyhani-Masoleh, A
    Hasan, MA
    2002 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL V, PROCEEDINGS, 2002, : 781 - 784
  • [7] Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
    Koc, CK
    Sunar, B
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (03) : 353 - 356
  • [8] Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
    Koc, CK
    Sunar, B
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 294 - 294
  • [9] A search of minimal key functions for normal basis multipliers
    Lu, CC
    IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (05) : 588 - 592
  • [10] A graph-based approach to designing parallel multipliers over Galois fields based on normal basis representations
    Okamoto, Kotaro
    Homma, Naofumi
    Aoki, Takafumi
    2013 IEEE 43RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2013), 2013, : 158 - 163
12345