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

被引：23
|
作者：
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 条
  • [21] Efficient Bit-Parallel Systolic Multiplier over GF (2m)
    Mozhi, S. Arul
    Ramya, P.
    2016 INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, AND OPTIMIZATION TECHNIQUES (ICEEOT), 2016, : 4899 - 4902
  • [22] Low complexity architecture of bit parallel multipliers for GF(2m)
    Shou, G.
    Mao, Z.
    Hu, Y.
    Guo, Z.
    Qian, Z.
    ELECTRONICS LETTERS, 2010, 46 (19) : 1326 - 1327
  • [23] Efficient Bit-Parallel Systolic Multiplier over GF (2m)
    Mozhi, S. Arul
    Ramya, P.
    2016 INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS, AND OPTIMIZATION TECHNIQUES (ICEEOT), 2016, : 4800 - 4803
  • [24] Efficient design of low-complexity bit-parallel systolic hankel multipliers to implement multiplication in normal and dual bases of GF (2m)
    Lee, CY
    Chiou, CW
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (11): : 3169 - 3179
  • [25] Universal VLSI architecture for bit-parallel computation in GF(2m)
    Lin, CC
    Chang, FK
    Chang, HC
    Lee, CY
    PROCEEDINGS OF THE 2004 IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 1 AND 2: SOC DESIGN FOR UBIQUITOUS INFORMATION TECHNOLOGY, 2004, : 125 - 128
  • [26] A systolic bit-parallel multiplier with flexible latency and complexity over GF(2m) using polynomial basis
    Zhang, Jingxian
    Song, Zheng
    Hu, Qingsheng
    ADVANCED MATERIALS AND ENGINEERING MATERIALS, PTS 1 AND 2, 2012, 457-458 : 848 - 855
  • [27] Systolic formulation for low-complexity serial-parallel implementation of unified finite field multiplication over GF(2m)
    Meher, Pramod Kumar
    2007 IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, 2007, : 134 - 139
  • [28] Multiplexer-based bit-parallel systolic multipliers over GF(2m)
    Lee, Chiou-Yng
    COMPUTERS & ELECTRICAL ENGINEERING, 2008, 34 (05) : 392 - 405
  • [29] Efficient bit-parallel multipliers over finite fields GF(2m)
    Lee, Chiou-Yng
    Meher, Pramod Kumar
    COMPUTERS & ELECTRICAL ENGINEERING, 2010, 36 (05) : 955 - 968
  • [30] Low-latency area-efficient systolic bit-parallel GF(2m) multiplier for a narrow class of trinomials
    Pillutla, Siva Ramakrishna
    Boppana, Lakshmi
    MICROELECTRONICS JOURNAL, 2021, 117
12345