Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials
Naoki Kanayama, Yang Liu, Eiji Okamoto, Kazutaka SAITO, Tadanori Teruya, Shigenori Uchiyama
Abstract
Naoki Kanayama, Yang Liu, Eiji Okamoto, Kazutaka SAITO, Tadanori Teruya, Shigenori Uchiyama
Abstract
We implemented a scalar multiplication method over elliptic curves using division polynomials. We adapt an algorithm for computing elliptic nets proposed by Stange. According to our experimental results, the scalar multiplication method using division polynomials is faster than the binary method in an affine coordinate system.
OpenAlex reports 9 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.
We implemented a scalar multiplication method over elliptic curves using division polynomials. We adapt an algorithm for computing elliptic nets proposed by Stange. According to our experimental results, the scalar multiplication method using division polynomials is faster than the binary method in an affine coordinate system.
Key concepts: Scalar multiplication, Division (mathematics), Scalar (mathematics), Mathematics, Division polynomials, Elliptic curve point multiplication, Multiplication (music), Elliptic curve