Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations

Sung Min Cho; Seung Gyu Gwak; Chang Han Kim; Seokhie Hong

doi:10.1007/s11042-016-3272-y

Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations

Sung Min Cho, Seung Gyu Gwak, Chang Han Kim, Seokhie Hong

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

In this work, we propose an algorithm to produce the Triple-base chain that optimize the time usage for computing an elliptic curve cryptosystem. Triple-base Chain is a scalar multiplication algorithm, which represents an integer k using three bases {2,3,5}. This paper provides a faster scalar multiplication method of elliptic curve based on {2,3,5} Triple-base Chain. The method proposed by this research speeds up the existing Triple-base Chain algorithm by optimizing the 5P operation of elliptic curve and reordering the operation order of base {2,3,5}. This method can improve the speed of operation from 4 to 6 % compared to the existing {2,3,5} Triple-base Chain.

Original language	English
Pages (from-to)	1-13
Number of pages	13
Journal	Multimedia Tools and Applications
DOIs	https://doi.org/10.1007/s11042-016-3272-y
Publication status	Accepted/In press - 2016 Jan 29

Keywords

5P operation
Elliptic curve cryptography
Reordering
Triple-base chain

ASJC Scopus subject areas

Media Technology
Hardware and Architecture
Computer Networks and Communications
Software

Access to Document

10.1007/s11042-016-3272-y

Cite this

@article{23e8756a5dd745a4950ad625896d2b5c,

title = "Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations",

abstract = "In this work, we propose an algorithm to produce the Triple-base chain that optimize the time usage for computing an elliptic curve cryptosystem. Triple-base Chain is a scalar multiplication algorithm, which represents an integer k using three bases {2,3,5}. This paper provides a faster scalar multiplication method of elliptic curve based on {2,3,5} Triple-base Chain. The method proposed by this research speeds up the existing Triple-base Chain algorithm by optimizing the 5P operation of elliptic curve and reordering the operation order of base {2,3,5}. This method can improve the speed of operation from 4 to 6 % compared to the existing {2,3,5} Triple-base Chain.",

keywords = "5P operation, Elliptic curve cryptography, Reordering, Triple-base chain",

author = "Cho, {Sung Min} and Gwak, {Seung Gyu} and Kim, {Chang Han} and Seokhie Hong",

year = "2016",

month = jan,

day = "29",

doi = "10.1007/s11042-016-3272-y",

language = "English",

pages = "1--13",

journal = "Multimedia Tools and Applications",

issn = "1380-7501",

publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations

AU - Cho, Sung Min

AU - Gwak, Seung Gyu

AU - Kim, Chang Han

AU - Hong, Seokhie

PY - 2016/1/29

Y1 - 2016/1/29

N2 - In this work, we propose an algorithm to produce the Triple-base chain that optimize the time usage for computing an elliptic curve cryptosystem. Triple-base Chain is a scalar multiplication algorithm, which represents an integer k using three bases {2,3,5}. This paper provides a faster scalar multiplication method of elliptic curve based on {2,3,5} Triple-base Chain. The method proposed by this research speeds up the existing Triple-base Chain algorithm by optimizing the 5P operation of elliptic curve and reordering the operation order of base {2,3,5}. This method can improve the speed of operation from 4 to 6 % compared to the existing {2,3,5} Triple-base Chain.

AB - In this work, we propose an algorithm to produce the Triple-base chain that optimize the time usage for computing an elliptic curve cryptosystem. Triple-base Chain is a scalar multiplication algorithm, which represents an integer k using three bases {2,3,5}. This paper provides a faster scalar multiplication method of elliptic curve based on {2,3,5} Triple-base Chain. The method proposed by this research speeds up the existing Triple-base Chain algorithm by optimizing the 5P operation of elliptic curve and reordering the operation order of base {2,3,5}. This method can improve the speed of operation from 4 to 6 % compared to the existing {2,3,5} Triple-base Chain.

KW - 5P operation

KW - Elliptic curve cryptography

KW - Reordering

KW - Triple-base chain

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

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

U2 - 10.1007/s11042-016-3272-y

DO - 10.1007/s11042-016-3272-y

M3 - Article

AN - SCOPUS:84955592732

SN - 1380-7501

SP - 1

EP - 13

JO - Multimedia Tools and Applications

JF - Multimedia Tools and Applications

ER -

Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this