CONCURRENT ALGORITHM FOR HIGH-SPEED POINT MULTIPLICATION IN ELLIPTIC CURVE CRYPTOGRAPHY

摘要

This paper explores the concurrent property inherent in the point multipKcalion to speed up the operations of encryption and decryption in Elliptic Curve Cryptography (ECC) under limited hardware resources. To further decrease the computation time, we employed the non-adjacent form of a binary sequence to reduce the number of Ps in an operand so as to decrease the total number of addition in ECC encryption/decryption. With, the developed interleaving schemes, we can fully use the idle time of hardware resources by relaxing the data dependency on those arithmetic operations performed to accomplish the point multiplication. As a result, by way of increasing the hardware utilization, we can achieve the performance of radix-4 arithmetic in the existing work by only employing the radix-2 hardware realization.