Name
Abstract | ||
|---|---|---|
This letter presents a low-complexity semi-systolic array implementation for polynomial multiplication over GF(2(m)). We consider finite field Montgomery modular multiplication (MMM) based on two-level parallel computing approach to reduce the cell delay, latency, and area-time (AT) complexity. Compared to related multipliers, the proposed scheme yields significantly lower AT complexity. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1587/elex.14.20160797 | IEICE ELECTRONICS EXPRESS |
Keywords | Field | DocType |
modular multiplication, finite field arithmetic, systolic array | Discrete mathematics,Finite field,Primitive polynomial,Polynomial,Modular arithmetic,Systolic array,Multiplier (economics),Finite field arithmetic,GF(2),Mathematics | Journal |
Volume | Issue | ISSN |
14 | 17 | 1349-2543 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Se-Hyu Choi | 1 | 1 | 0.77 |
| Keon-Jik Lee | 2 | 12 | 3.63 |