Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

被引：141
|
作者：
Koc, CK [1 ]
Sunar, B [1 ]
机构：
[1] Oregon State Univ, Dept Elect & Comp Engn, Corvallis, OR 97331 USA
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1998年 / 47卷 / 03期
关键词：
finite fields; multiplication; normal basis; canonical basis; all-one-polynomial;
D O I：
10.1109/12.660172
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2(m)) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m(2) - 1 XOR gates and m(2) AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.
引用
收藏
页码：353 / 356
页数：4
相关论文
共 50 条
  • [1] 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
  • [2] Low complexity bit-parallel multipliers for a class of finite fields
    Wu, HP
    Hasan, MA
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (08) : 883 - 887
  • [3] Low complexity bit-parallel multiplier for a class of finite fields
    Wu, Huapeng
    2006 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS PROCEEDINGS, VOLS 1-4: VOL 1: SIGNAL PROCESSING, 2006, : 2565 - 2568
  • [4] Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
    Lee, CY
    Chiou, CW
    Lin, JM
    COMPUTERS & ELECTRICAL ENGINEERING, 2005, 31 (07) : 444 - 459
  • [5] New low-complexity bit-parallel finite field multipliers using weakly dual bases
    Wu, HP
    Hasan, MA
    Blake, IF
    IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (11) : 1223 - 1234
  • [6] Low complexity bit-parallel multipliers based on a class of irreducible pentanomials
    Imana, Jose Luis
    Hermida, Roman
    Tirado, Francisco
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2006, 14 (12) : 1388 - 1393
  • [7] Low complexity bit-parallel polynomial basis multipliers over binary fields for special irreducible pentanomials
    Imana, Jose L.
    Hermida, Roman
    Tirado, Francisco
    INTEGRATION-THE VLSI JOURNAL, 2013, 46 (02) : 197 - 210
  • [8] Low-complexity bit-parallel systolic multipliers over GF(2m)
    Lee, Chiou-Yng
    INTEGRATION-THE VLSI JOURNAL, 2008, 41 (01) : 106 - 112
  • [9] Low-complexity bit-parallel systolic multipliers over GF(2m)
    Chiou-Yng Lee
    Chin-Chin Chen
    Yuan-Ho Chen
    Erl-Huei Lu
    2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 1160 - 1165
  • [10] Bit-Parallel Multipliers for Different Irreducible Polynomials in Finite Fields
    Yi, Haibo
    Li, Weijian
    Nie, Zhe
    PROCEEDINGS OF 2016 IEEE 7TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS 2016), 2016, : 505 - 508
12345