Parallel scalar multiplication for elliptic curve cryptosystems
Bijan Ansari, Huapeng Wu · 2005
A parallel elliptic curve scalar multiplication algorithm is proposed. The algorithm works at its highest efficiency when a dual-processor hardware system is utilized. The new method has an average computation time of n/3 times of that of one elliptic curve addition (ECADD) on an n-bit scalar. The saving is n elliptic curve doublings (ECDBLs) compared to standard (single processor) methods. When the ratio of the execution time of a point addition to that of a point doubling is 3, the proposed method is 90% faster than the standard method.