Home

Parallelizing GF(P) Elliptic Curve Cryptography Computations for Security and Speed


Author(s) : Turki Faisal Al-Somani Mohammad K. Ibrahim Adnan Gutub, 
Publisher : N/A
Publication Date : 2007
ISSN : N/A
Abstract : The elliptic curve cryptography can be observed as two levels of computations, upper scalar multiplication level and lower point operations level. We combine the inherited parallelism in both levels to reduce the delay and improve security against the simple power attack. The best security and speed performance is achieved when parallelizing the computation to eight parallel multiplication operations. This strategy is worth considering since it shows very attractive performance conclusions.,