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 article

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

Fingerprint

Cryptography
Hardware
Binary sequences
Computer hardware

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{7df568f2654f4ef7adf4696dcb9773ad,
title = "Concurrent algorithm for High-Speed point multiplication in elliptic curve cryptography",
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.",
author = "Chen, {Jun Hong} and Ming-Der Shieh and Wu, {Chien Ming}",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ISCAS.2005.1465820",
language = "English",
pages = "5254--5257",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Concurrent algorithm for High-Speed point multiplication in elliptic curve cryptography. / Chen, Jun Hong; Shieh, Ming-Der; Wu, Chien Ming.

In: Proceedings - IEEE International Symposium on Circuits and Systems, 01.12.2005, p. 5254-5257.

Research output: Contribution to journalConference article

TY - JOUR

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

AU - Chen, Jun Hong

AU - Shieh, Ming-Der

AU - Wu, Chien Ming

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=67649097313&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67649097313&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.2005.1465820

DO - 10.1109/ISCAS.2005.1465820

M3 - Conference article

AN - SCOPUS:67649097313

SP - 5254

EP - 5257

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

M1 - 1465820

ER -