Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations
- Authors
- Cho, Sung Min; Gwak, Seung Gyu; Kim, Chang Han; Hong, Seokhie
- Issue Date
- 11월-2016
- Publisher
- SPRINGER
- Keywords
- Elliptic curve cryptography; Triple-base chain; Reordering; 5P operation
- Citation
- MULTIMEDIA TOOLS AND APPLICATIONS, v.75, no.22, pp.14819 - 14831
- Indexed
- SCIE
SCOPUS
- Journal Title
- MULTIMEDIA TOOLS AND APPLICATIONS
- Volume
- 75
- Number
- 22
- Start Page
- 14819
- End Page
- 14831
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/86948
- DOI
- 10.1007/s11042-016-3272-y
- ISSN
- 1380-7501
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.