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 journalArticle

1 Citation (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 languageEnglish
Pages (from-to)1-13
Number of pages13
JournalMultimedia Tools and Applications
DOIs
Publication statusAccepted/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

Fingerprint Dive into the research topics of 'Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations'. Together they form a unique fingerprint.

  • Cite this