Name
Title | ||
|---|---|---|
New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography |
Abstract | ||
|---|---|---|
We propose a new linear array for multiplication in GF(2m) which outperforms most of the existing linear multipliers in terms of the area and time complexity. Moreover we will give a very detailed comparison of our array with other existing architectures for the five binary fields GF(2m), m = 163,233,283,409,571, recommended by NIST for elliptic curve cryptography. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1093/ietfec/e91-a.1.236 | IEICE Transactions |
Keywords | Field | DocType |
detailed comparison,new hardware architecture,existing linear multiplier,polynomial basis multipliers,new linear array,existing architecture,binary fields gf,elliptic curve cryptography,time complexity,hardware architecture,nist,dual basis,normal basis | Elliptic Curve Digital Signature Algorithm,Polynomial basis,Discrete mathematics,Arithmetic,Theoretical computer science,Multiplication,NIST,Dual basis,Elliptic curve cryptography,Time complexity,Mathematics,Hardware architecture | Journal |
Volume | Issue | ISSN |
E91-A | 1 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Soonhak Kwon | 1 | 170 | 22.00 |
| Taekyoung Kwon | 2 | 1894 | 153.24 |
| Young-Ho Park | 3 | 137 | 16.79 |