An Efficient Elliptic Curve Scalar Multiplication Algorithm Suitable for Wireless Network
Min Tian, Jizhi Wang, Yinglong Wang, Shujiang Xu
Abstract
Min Tian, Jizhi Wang, Yinglong Wang, Shujiang Xu
Abstract
Elliptic curve cryptosystems are suitable for memory-constraint devices like wireless network due to their small key-size. A novel approach is proposed to speed up the pre-computation stage of window-w nonadjacent form elliptic curve scalar multiplication by conjugate additions and strategic points. Our analysis shows that the proposed scheme offers lower costs than other known methods for various elliptic curve forms.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Elliptic curve cryptosystems are suitable for memory-constraint devices like wireless network due to their small key-size. A novel approach is proposed to speed up the pre-computation stage of window-w nonadjacent form elliptic curve scalar multiplication by conjugate additions and strategic points. Our analysis shows that the proposed scheme offers lower costs than other known methods for various elliptic curve forms.
Key concepts: Elliptic curve point multiplication, Scalar multiplication, Elliptic Curve Digital Signature Algorithm, Elliptic curve cryptography, Tripling-oriented Doche–Icart–Kohel curve, Curve25519, Elliptic curve, Hessian form of an elliptic curve