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 条
  • [1] Fast Bit-Parallel Polynomial Basis Multiplier for GF(2m) Defined by Pentanomials Using Weakly Dual Basis
    Park, Sun-Mi
    Chang, Ku-Young
    Hong, Dowon
    Seo, Changho
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2013, E96A (01) : 322 - 331
  • [2] A systolic bit-parallel multiplier with flexible latency and complexity over GF(2m) using polynomial basis
    Zhang, Jingxian
    Song, Zheng
    Hu, Qingsheng
    [J]. ADVANCED MATERIALS AND ENGINEERING MATERIALS, PTS 1 AND 2, 2012, 457-458 : 848 - 855
  • [3] Fault-Tolerant Bit-Parallel Multiplier for Polynomial Basis of GF(2m)
    Lee, Chiou-Yng
    Lee, Wen-Yo
    Meher, Pramod Kumar
    [J]. IEEE CIRCUITS AND SYSTEMS INTERNATIONAL CONFERENCE ON TESTING AND DIAGNOSIS, 2009, : 403 - +
  • [4] Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation
    Chiou-Yng Lee
    Jenn-Shyong Horng
    I-Chang Jou
    [J]. Journal of Computer Science and Technology, 2006, 21 : 887 - 892
  • [5] Low-complexity bit-parallel multiplier over GF(2m) using dual basis representation
    Lee, Chiou-Yng
    Horng, Jenn-Shyong
    Jou, I-Chang
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (06): : 887 - 892
  • [6] Low-complexity design of bit-parallel dual-basis multiplier over GF(2m)
    Wang, J. -H.
    Chang, H. W.
    Chiou, C. W.
    Liang, W. -Y.
    [J]. IET INFORMATION SECURITY, 2012, 6 (04) : 324 - 328
  • [7] Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m)
    Chiou-Yng Lee
    Che Wun Chiou
    Jim-Min Lin
    [J]. Journal of Electronic Testing, 2005, 21 : 539 - 549
  • [8] Concurrent error detection in a bit-parallel systolic multiplier for dual basis of GF(2m)
    Lee, CY
    Chiou, C
    Lin, JM
    [J]. JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 2005, 21 (05): : 539 - 549
  • [9] Non-XOR approach for low-cost bit-parallel polynomial basis multiplier over GF(2m)
    Huang, W. -T.
    Chang, C. H.
    Chiou, C. W.
    Tan, S. -Y.
    [J]. IET INFORMATION SECURITY, 2011, 5 (03) : 152 - 162
  • [10] Efficient bit-parallel multiplier for irreducible pentanomials using a shifted polynomial basis
    Park, Sun-Mi
    Chang, Ku-Young
    Hong, Dowon
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2006, 55 (09) : 1211 - 1215
12345