Concurrent algorithm for High-Speed point multiplication in elliptic curve cryptography

Jun Hong Chen, Ming-Der Shieh, Chien Ming Wu

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Article number1465820
Pages (from-to)5254-5257
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
DOIs
Publication statusPublished - 2005 Dec 1
EventIEEE International Symposium on Circuits and Systems 2005, ISCAS 2005 - Kobe, Japan
Duration: 2005 May 232005 May 26

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Concurrent algorithm for High-Speed point multiplication in elliptic curve cryptography'. Together they form a unique fingerprint.

Cite this