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
基金
新加坡国家研究基金会;
关键词
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 条