Division polynomial-based elliptic curve scalar multiplication revisited

Abstract

Here, the authors provide a derivation of an improvement to Kanayama's elliptic curve scalar multiplication algorithm using division polynomials. In addition, they also provide experimental results and show that the improvement is useful when the elliptic curve under consideration is defined over large prime fields.

Document Type

Journal Article

School

ECU Security Research Institute

RAS ID

31198

Copyright

subscription content

Publisher

Institution of Engineering and Technology

Comments

SubramanyaRao, S., Hu, Z., & Zhao, C.-A. (2019). Division polynomial-based elliptic curve scalar multiplication revisited. IET Information Security, 13(6), 614-617. Available here

Share

 
COinS
 

Link to publisher version (DOI)

10.1049/iet-ifs.2018.5361