Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations
| Autor: | Seung Gyu Gwak, Sung Min Cho, Seokhie Hong, Chang Han Kim |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Computer Networks and Communications
Computer science 020206 networking & telecommunications 02 engineering and technology Topology Scalar multiplication 020202 computer hardware & architecture Schoof–Elkies–Atkin algorithm Elliptic curve point multiplication Elliptic curve Hardware and Architecture Jacobian curve Elliptic curve cryptosystem 0202 electrical engineering electronic engineering information engineering Media Technology Schoof's algorithm Elliptic curve cryptography Algorithm Software Tripling-oriented Doche–Icart–Kohel curve |
| Zdroj: | Multimedia Tools and Applications. 75:14819-14831 |
| ISSN: | 1573-7721 1380-7501 |
| DOI: | 10.1007/s11042-016-3272-y |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink