This paper explores the concurrent property inherent in the point multiplication 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 nonadjacent form of a binary sequence to reduce the number of 1's 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.
|Number of pages||4|
|Journal||Proceedings - IEEE International Symposium on Circuits and Systems|
|Publication status||Published - 2005 Dec 1|
|Event||IEEE International Symposium on Circuits and Systems 2005, ISCAS 2005 - Kobe, Japan|
Duration: 2005 May 23 → 2005 May 26
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering