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 条

[21] Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials
Lee, CY
[J]. IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2003, 150 (01): : 39 - 42
[22] Concurrent error detection in a polynomial basis multiplier over GF(2m)
Lee, CY
Chiou, CW
Lin, JM
[J]. JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS, 2006, 22 (02): : 143 - 150
[23] Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m)
Ho, Huong
[J]. JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2014, 75 (03): : 203 - 208
[24] Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m)
Huong Ho
[J]. Journal of Signal Processing Systems, 2014, 75 : 203 - 208
[25] Design and Implementation of a Sequential Polynomial Basis Multiplier over GF(2m)
Mathe, Sudha Ellison
Boppana, Lakshmi
[J]. KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2017, 11 (05): : 2680 - 2700
[26] Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)
Chiou-Yng Lee
Che Wun Chiou
Jim-Min Lin
[J]. Journal of Electronic Testing, 2006, 22 : 143 - 150
[27] Bit-parallel finite field multiplier and squarer using polynomial basis
Wu, HP
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (07) : 750 - 758
[28] Low Latency GF(2m) Polynomial Basis Multiplier
Luis Imana, Jose
[J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2011, 58 (05) : 935 - 946
[29] High Speed Bit-Parallel Systolic Multiplier over GF (2m) for Cryptographic Application
Sargunam, B.
Mozhi, S. Arul
Dhanasekaran, R.
[J]. 2012 IEEE INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION CONTROL AND COMPUTING TECHNOLOGIES (ICACCCT), 2012, : 244 - 247
[30] Fast and Pipelined Bit-Parallel Montgomery Multiplication and Squaring over GF(2m)
Rashidi, Bahram
Sayedi, Sayed Masoud
Farashahi, Reza Rezaeian
[J]. 2015 12TH INTERNATIONAL IRANIAN SOCIETY OF CRYPTOLOGY CONFERENCE ON INFORMATION SECURITY AND CRYPTOLOGY (ISCISC), 2015, : 17 - 22

← 1 2 3 4 5 →