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.
Naoki KANAYAMA
University of Tsukuba
Yang LIU
University of Tsukuba
Eiji OKAMOTO
University of Tsukuba
Kazutaka SAITO
University of Tsukuba
Tadanori TERUYA
University of Tsukuba
Shigenori UCHIYAMA
Tokyo Metropolitan University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Naoki KANAYAMA, Yang LIU, Eiji OKAMOTO, Kazutaka SAITO, Tadanori TERUYA, Shigenori UCHIYAMA, "Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 1, pp. 300-302, January 2014, doi: 10.1587/transfun.E97.A.300.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.300/_p
Copy
@ARTICLE{e97-a_1_300,
author={Naoki KANAYAMA, Yang LIU, Eiji OKAMOTO, Kazutaka SAITO, Tadanori TERUYA, Shigenori UCHIYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials},
year={2014},
volume={E97-A},
number={1},
pages={300-302},
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.},
keywords={},
doi={10.1587/transfun.E97.A.300},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Implementation of an Elliptic Curve Scalar Multiplication Method Using Division Polynomials
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 300
EP - 302
AU - Naoki KANAYAMA
AU - Yang LIU
AU - Eiji OKAMOTO
AU - Kazutaka SAITO
AU - Tadanori TERUYA
AU - Shigenori UCHIYAMA
PY - 2014
DO - 10.1587/transfun.E97.A.300
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2014
AB - 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.
ER -