To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Cost-Effective Implementations of GF (p) Elliptic Curve Cryptography Computations |
|
Author |
Hakim Khali Mieee, Ahcene Farah Sieee |
| Citation |
Vol. 7 No. 8 pp. 29-37 |
|
Abstract |
This research paper aims at analyzing the impact of exploiting the parallelism available in two common Elliptic Curve Cryptography (ECC) projective forms on speed and cost factors, assuming point-multiplication is implemented using the m-ary algorithm instead of the popular binary algorithm. Point-multiplication is implemented using scalable multipliers in order to replicate the design for varying-size security keys. Simulation results are shown for each projective form and a cross comparison is also performed as well. |
|
Keywords |
ECC, projective forms, modulo multipliers |
|
URL |
