Open AccessDivision polynomial‐based elliptic curve scalar multiplication revisited
Author(s) -
SubramanyaRao SrinivasaRao,
Hu Zhi,
Zhao ChangAn
Publication year - 2019
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2018.5361
Subject(s) - scalar multiplication , division polynomials , elliptic curve point multiplication , mathematics , schoof's algorithm , division (mathematics) , hessian form of an elliptic curve , elliptic curve , scalar (mathematics) , supersingular elliptic curve , polynomial , elliptic curve cryptography , multiplication (music) , prime (order theory) , algebra over a field , discrete mathematics , pure mathematics , arithmetic , quarter period , mathematical analysis , computer science , combinatorics , geometry , public key cryptography , encryption , operating system
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.