Parallelizing GF(P) elliptic curve cryptography computations for security and speed
Adnan Abdul Aziz Gutub, M.K. Ibrahim, Turki F. Al-Somani · 2007
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.