|
Title:
|
SERIAL VS. PARALLEL ELLIPTIC CURVE CRYPTO PROCESSOR DESIGNS |
|
Author(s):
|
Adnan Abdul-Aziz Gutub, Abdul-Aziz Tabakh, Ayed Al-Qahtani, Alaaeldin Amin |
|
ISBN:
|
978-989-8533-20-3 |
|
Editors:
|
Hans Weghorn |
|
Year:
|
2013 |
|
Edition:
|
Single |
|
Keywords:
|
Elliptic curve cryptography, serial & parallel implementation, modulo multiplier architecture, Aladdin multiplier, projective coordinates, data security. |
|
Type:
|
Full Paper |
|
First Page:
|
67 |
|
Last Page:
|
74 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Point conversion in Elliptic Curve Cryptography (ECC) arithmetic suffer the costly complex division operation. Several methods proposed to overcome this division by multiple multiplication steps using chosen projective coordinates systems. This work adopts Aladdin Modulo Multiplier algorithm (an improvement to Montgomery modulo multiplier) in its design to compare both serial and parallel ECC multiplier hardware for its computations. The investigation focuses on tradeoffs between time and area showing the benefit of different ECC designs, i.e. using serial and parallel Aladdin modulo multipliers. |
|
|
|
|
|
|
