Name
Title | ||
|---|---|---|
New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography |
Abstract | ||
|---|---|---|
We propose a new linear multiplier which is comparable to linear polynomial basis multipliers in terms of the area and time complexity. Also we give a very detailed comparison of our multiplier with the normal and polynomial basis multipliers for the five binary fields GF(2m), m=163,233,283,409,571, recommended by NIST for elliptic curve digital signature algorithm. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11734727_27 | international conference on information security and cryptology |
Keywords | DocType | Volume |
elliptic curve,detailed comparison,linear polynomial basis multiplier,new architecture,polynomial basis multiplier,new linear multiplier,binary fields GF,digital signature algorithm,elliptic curve cryptography,time complexity | Conference | 3935 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-33354-1 | 1 |
PageRank | References | Authors |
0.36 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Soonhak Kwon | 1 | 170 | 22.00 |
| Taekyoung Kwon | 2 | 1894 | 153.24 |
| Young-Ho Park | 3 | 137 | 16.79 |