TY - JOUR
T1 - Speeding up scalar multiplications on hyperelliptic curves by making use of Frobenius endomorphism
AU - You, Lin
AU - Xu, Maozhi
AU - Zhao, Junzhong
AU - Zheng, Zhiming
PY - 2006/1
Y1 - 2006/1
N2 - Divisor scalar multiplication is the vital operation in hyperelliptic curve cryptosystems. In this paper, by using Frobenius endomorphism, we propose a new efficient algorithm to perform this operation. If a normal basis is applied and the pre-computations and the evaluations of Frobenius endomorphism are considered free, then, for some hyperelliptic curves, our algorithm is much faster than Signed Binary method and Zhang's method.
AB - Divisor scalar multiplication is the vital operation in hyperelliptic curve cryptosystems. In this paper, by using Frobenius endomorphism, we propose a new efficient algorithm to perform this operation. If a normal basis is applied and the pre-computations and the evaluations of Frobenius endomorphism are considered free, then, for some hyperelliptic curves, our algorithm is much faster than Signed Binary method and Zhang's method.
KW - Binary method
KW - Characteristic polynomial
KW - Cryptosystems
KW - Divisor scalar multiplications
KW - Frobenius endomorphism
KW - Hyperelliptic curves
UR - https://www.scopus.com/pages/publications/31644435144
M3 - 文章
AN - SCOPUS:31644435144
SN - 1022-4653
VL - 15
SP - 123
EP - 128
JO - Chinese Journal of Electronics
JF - Chinese Journal of Electronics
IS - 1
ER -