Performance Analysis of the Postcomputation- Based Generic-Point Parallel Scalar Multiplication Method
Turki F. Al-Somani · Global Journal of Computer Science and Technology · 2010
A Postcomputation-based generic-point parallel scalar multiplication method has recently been proposed for high-performance end servers that employ parallel elliptic curve cryptoprocessors. The sequential precomputation overheads, in the postcomputation-based method, are replaced with parallelizable postcomputations. This paper analyzes the performance of the postcomputation-based method with 128 ≤ m ≤ 256 using a number of parallel elliptic curve cryptoprocessors. The results show that the best performance is achieved when eight cryptoprocessors are used.