Name
Abstract | ||
|---|---|---|
In this paper, we present a low complexity bit-parallel Montgomery multiplier for GF(2(m)) generated with irreducible Type C.1 pentanomials x(m) + x(m-1) + x(k) + x + 1. Based on a combination of generalized polynomial basis (GPB) squarer and a newly proposed square-based divide and conquer approach, we can partition field multiplication into a composition of sub-polynomial multiplications and Montgomery/GPB squarings, which have simpler architecture and thus can be implemented efficiently. Consequently, the proposed multiplier roughly saves 1/4 logic gates compared with the fastest multipliers, while the time complexity matches previous multipliers using divide and conquer algorithms. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/ACCESS.2018.2806003 | IEEE ACCESS |
Keywords | DocType | Volume |
Bit-parallel,montgomery multiplication,squaring,type C.1 pentanomial | Journal | 6 |
ISSN | Citations | PageRank |
2169-3536 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yin Li | 1 | 16 | 15.52 |
| Xingpo Ma | 2 | 0 | 1.69 |
| Qing Chen | 3 | 22 | 8.74 |
| Chuanda Qi | 4 | 14 | 6.01 |