Division polynomial‐based elliptic curve scalar multiplication revisited
SrinivasaRao SubramanyaRao, Zhi Hong Hu, Chang‐An Zhao
Abstract
Open-access reader
SrinivasaRao SubramanyaRao, Zhi Hong Hu, Chang‐An Zhao
Abstract
Open-access reader
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.
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.
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.
Key concepts: Scalar multiplication, Division polynomials, Elliptic curve point multiplication, Mathematics, Schoof's algorithm, Division (mathematics), Hessian form of an elliptic curve, Elliptic curve