Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over GF(2m)

被引：6
|
作者：
Park, Sun-Mi [1 ]
Chang, Ku-Young [2 ]
机构：
[1] Korea Adv Inst Sci & Technol, Dept Math Sci, Taejon 305701, South Korea
[2] Elect & Telecommuni Res Inst, Cryptog Res Team, Taejon, South Korea
来源：
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS | 2011年 / 19卷 / 12期
基金：
新加坡国家研究基金会;
关键词：
Bit-parallel multiplier; finite field arithmetic; pentanomial; shifted polynomial basis; weakly dual basis (WDB); IRREDUCIBLE PENTANOMIALS;
D O I：
10.1109/TVLSI.2010.2075946
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we present a new method to compute the Mastrovito matrix for GF(2(m)) generated by an arbitrary irreducible polynomial using weakly dual basis of shifted polynomial basis. In particular, we derive the explicit formulas of the proposed multiplier for special type of irreducible pentanomial x(m) + x(k3) + x(k2) +x(k1) + 1 with k(1) < k(2) <= (k(1) +k(3))/2 < k(3) < min(2k(1) , m/2). As a result, the time complexity of the proposed multiplier matches or outperforms the previously known results. On the other hand, the number of XOR gates of the proposed multiplier is slightly greater than the best known results.
引用
收藏
页码：2317 / 2321
页数：5
相关论文
共 50 条
  • [11] Compact Bit-Parallel Systolic Multiplier Over GF(2m)
    Ibrahim, Atef
    Gebali, Fayez
    Bouteraa, Yassine
    Tariq, Usman
    Ahanger, Tariq
    Alnowaiser, Khaled
    IEEE CANADIAN JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING, 2021, 44 (02): : 199 - 205
  • [12] 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
  • [13] 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
  • [14] Efficient implementation of bit-parallel fault tolerant polynomial basis multiplication and squaring over GF(2m)
    Rashidi, Bahram
    Sayedi, Sayed Masoud
    Farashahi, Reza Rezaeian
    IET COMPUTERS AND DIGITAL TECHNIQUES, 2016, 10 (01): : 18 - 29
  • [15] Parity-based on-line detection for a bit-parallel systolic dual-basis multiplier over GF(2m)
    2006 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, PROCEEDINGS, 2006, : 783 - 786
  • [16] Low-Power and Low-Hardware Bit-Parallel Polynomial Basis Systolic Multiplier over GF(2m) for Irreducible Polynomials
    Mathe, Sudha Ellison
    Boppana, Lakshmi
    ETRI JOURNAL, 2017, 39 (04) : 570 - 581
  • [17] Low-complexity systolic multiplier over GF(2m) using weakly dual basis
    Lee, CY
    Lu, YC
    Lu, EH
    APCCAS 2002: ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 1, PROCEEDINGS, 2002, : 367 - 372
  • [18] SCALABLE AND SYSTOLIC DUAL BASIS MULTIPLIER OVER GF(2m)
    Chen, Liang-Hwa
    Chang, Po-Lun
    Lee, Chiou-Yng
    Yang, Ying-Kuei
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2011, 7 (03): : 1193 - 1208
  • [19] Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)
    Reyhani-Masoleh, A
    Hasan, MA
    IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (08) : 945 - 959
  • [20] Fault Tolerant Dual Basis Multiplier Over GF(2m)
    Lee, Chiou-Yng
    Meher, Pramod Kumar
    IEEE CIRCUITS AND SYSTEMS INTERNATIONAL CONFERENCE ON TESTING AND DIAGNOSIS, 2009, : 436 - +
12345