Low-complexity bit-parallel systolic architecture for computing AB2+C in a class of finite field GF(2m)

被引：22
|
作者：
Lee, CY [1 ]
Lu, EH
Sun, LF
机构：
[1] Chang Gung Univ, Dept Elect Engn, Chungli 320, Taiwan
[2] Chung Hwa Telecommun Lab, Dept Program Coordinat, Chung Hwa, Taiwan
来源：
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING | 2001年 / 48卷 / 05期
关键词：
all one polynomial (AOP); finite field; latency; systolic multiplier;
D O I：
10.1109/82.938363
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
An algorithm for computing AB(2) + C over a finite field GF(2(m)) is presented using the properties of the irreducible all one polynomial of degree m. Based on the algorithm, a parallel-in parallel-out systolic multiplier is proposed. The architecture of the multiplier is very simple, regular, modular, and exhibits very low latency and propagation delay. Therefore, it is suitable for very large scale integration implementation of cryptosystems.
引用
收藏
页码：519 / 523
页数：5
相关论文
共 50 条
  • [1] Low complexity bit-parallel systolic architecture for computing C+AB2 over a class of GF(2m)
    Ting, YR
    Lu, EH
    Lee, JY
    INTEGRATION-THE VLSI JOURNAL, 2004, 37 (03) : 167 - 176
  • [2] The design of a low-complexity systolic architecture for fast bit-parallel exponentiation in a class of GF(2m)
    Lee, CY
    Lu, EH
    Sun, LF
    2000 5TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, VOLS I-III, 2000, : 598 - 605
  • [3] Low-complexity bit-parallel systolic multipliers over GF(2m)
    Lee, Chiou-Yng
    INTEGRATION-THE VLSI JOURNAL, 2008, 41 (01) : 106 - 112
  • [4] 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
  • [5] Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2m)
    Lee, CY
    Horng, JS
    Jou, IC
    Lu, EH
    IEEE TRANSACTIONS ON COMPUTERS, 2005, 54 (09) : 1061 - 1070
  • [6] Low-complexity bit-parallel systolic architectures for computing A(x)B2(x) over GF(2m)
    Lee, C. -Y.
    Chiou, C. W.
    Deng, A. -W.
    Lin, J. -M
    IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 2006, 153 (04): : 399 - 406
  • [7] Bit-Parallel Systolic Architecture for AB and AB2 Multiplications over GF(2m)
    Kim K.-W.
    IEICE Transactions on Electronics, 2022, E105.C (05) : 203 - 206
  • [8] Bit-parallel systolic modular multipliers for a class of GF(2m)
    Lee, CY
    Lu, EH
    Lee, JY
    ARITH-15 2001: 15TH SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2001, : 51 - 58
  • [9] Parallel in/out systolic AB2 architecture with low complexity in GF(2m)
    Choi, S-H.
    Lee, K-J.
    ELECTRONICS LETTERS, 2016, 52 (13) : 1138 - 1139
  • [10] Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials
    Lee, CY
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2003, 150 (01): : 39 - 42
12345