## 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 | |

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