High-speed low-complexity elliptic curve cryptographic processor

Tuy Tan Nguyen; Hanho Lee

doi:10.1109/ISOCC.2015.7401749

High-speed low-complexity elliptic curve cryptographic processor

Tuy Tan Nguyen, Hanho Lee

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Scopus citations

Abstract

In this paper, we present a novel modified algorithm and architecture to compute Elliptic Curve Cryptographic point multiplication. The proposed algorithm significantly reduces the number of point addition operations. Furthermore, the field multiplication operations are scheduled to perform simultaneously to reduce the latency. As a result, our algorithm and architecture reduce the hardware complexity compared to others, while the required time for point multiplication is kept at a reasonable value. The simulation result on Xilinx Virtex-7 FPGA shows that the proposed architecture offers an improvement in hardware complexity up to 68% and much better efficiency compared to others.

Original language	English (US)
Title of host publication	ISOCC 2015 - International SoC Design Conference
Subtitle of host publication	SoC for Internet of Everything (IoE)
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	265-266
Number of pages	2
ISBN (Electronic)	9781467393089
DOIs	https://doi.org/10.1109/ISOCC.2015.7401749
State	Published - Feb 8 2016
Externally published	Yes
Event	12th International SoC Design Conference, ISOCC 2015 - Gyeongju, Korea, Republic of Duration: Nov 2 2015 → Nov 5 2015

Publication series

Name	ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE)

Conference

Conference	12th International SoC Design Conference, ISOCC 2015
Country/Territory	Korea, Republic of
City	Gyeongju
Period	11/2/15 → 11/5/15

Keywords

architecture
bit-serial
elliptic curve cryptography
point multiplication

ASJC Scopus subject areas

Hardware and Architecture
Electrical and Electronic Engineering
Electronic, Optical and Magnetic Materials

Access to Document

10.1109/ISOCC.2015.7401749

Cite this

Nguyen, T. T., & Lee, H. (2016). High-speed low-complexity elliptic curve cryptographic processor. In ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE) (pp. 265-266). Article 7401749 (ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE)). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISOCC.2015.7401749

High-speed low-complexity elliptic curve cryptographic processor. / Nguyen, Tuy Tan; Lee, Hanho.
ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE). Institute of Electrical and Electronics Engineers Inc., 2016. p. 265-266 7401749 (ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE)).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nguyen, TT & Lee, H 2016, High-speed low-complexity elliptic curve cryptographic processor. in ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE)., 7401749, ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE), Institute of Electrical and Electronics Engineers Inc., pp. 265-266, 12th International SoC Design Conference, ISOCC 2015, Gyeongju, Korea, Republic of, 11/2/15. https://doi.org/10.1109/ISOCC.2015.7401749

Nguyen TT, Lee H. High-speed low-complexity elliptic curve cryptographic processor. In ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE). Institute of Electrical and Electronics Engineers Inc. 2016. p. 265-266. 7401749. (ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE)). doi: 10.1109/ISOCC.2015.7401749

@inproceedings{fc3ae0dfa2ca44edb0534e8db50cd3de,

title = "High-speed low-complexity elliptic curve cryptographic processor",

abstract = "In this paper, we present a novel modified algorithm and architecture to compute Elliptic Curve Cryptographic point multiplication. The proposed algorithm significantly reduces the number of point addition operations. Furthermore, the field multiplication operations are scheduled to perform simultaneously to reduce the latency. As a result, our algorithm and architecture reduce the hardware complexity compared to others, while the required time for point multiplication is kept at a reasonable value. The simulation result on Xilinx Virtex-7 FPGA shows that the proposed architecture offers an improvement in hardware complexity up to 68% and much better efficiency compared to others.",

keywords = "architecture, bit-serial, elliptic curve cryptography, point multiplication",

author = "Nguyen, {Tuy Tan} and Hanho Lee",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 12th International SoC Design Conference, ISOCC 2015 ; Conference date: 02-11-2015 Through 05-11-2015",

year = "2016",

month = feb,

day = "8",

doi = "10.1109/ISOCC.2015.7401749",

language = "English (US)",

series = "ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE)",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "265--266",

booktitle = "ISOCC 2015 - International SoC Design Conference",

}

TY - GEN

T1 - High-speed low-complexity elliptic curve cryptographic processor

AU - Nguyen, Tuy Tan

AU - Lee, Hanho

PY - 2016/2/8

Y1 - 2016/2/8

N2 - In this paper, we present a novel modified algorithm and architecture to compute Elliptic Curve Cryptographic point multiplication. The proposed algorithm significantly reduces the number of point addition operations. Furthermore, the field multiplication operations are scheduled to perform simultaneously to reduce the latency. As a result, our algorithm and architecture reduce the hardware complexity compared to others, while the required time for point multiplication is kept at a reasonable value. The simulation result on Xilinx Virtex-7 FPGA shows that the proposed architecture offers an improvement in hardware complexity up to 68% and much better efficiency compared to others.

AB - In this paper, we present a novel modified algorithm and architecture to compute Elliptic Curve Cryptographic point multiplication. The proposed algorithm significantly reduces the number of point addition operations. Furthermore, the field multiplication operations are scheduled to perform simultaneously to reduce the latency. As a result, our algorithm and architecture reduce the hardware complexity compared to others, while the required time for point multiplication is kept at a reasonable value. The simulation result on Xilinx Virtex-7 FPGA shows that the proposed architecture offers an improvement in hardware complexity up to 68% and much better efficiency compared to others.

KW - architecture

KW - bit-serial

KW - elliptic curve cryptography

KW - point multiplication

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

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

U2 - 10.1109/ISOCC.2015.7401749

DO - 10.1109/ISOCC.2015.7401749

M3 - Conference contribution

AN - SCOPUS:84963787575

T3 - ISOCC 2015 - International SoC Design Conference: SoC for Internet of Everything (IoE)

SP - 265

EP - 266

BT - ISOCC 2015 - International SoC Design Conference

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 12th International SoC Design Conference, ISOCC 2015

Y2 - 2 November 2015 through 5 November 2015

ER -

High-speed low-complexity elliptic curve cryptographic processor

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this