Speeding Up Scalar Multiplications on Hyperelliptic Curves by Making Use of Frobenius Endomorphism  

作　　者：YOU Lin XU Maozhi ZHAO Junzhong ZHENG Zhiming 

机构地区：[1]Laboratory of Combinatorics and Information Science, Hainan Normal University, Haikou 571158, China [2]School of Science, Beijing University of Aeronautics and Astronautics , Beijing 100083, China [3]School of Mathematics Science, Peking University, Beijing 100871, China

出　　处：《Chinese Journal of Electronics》2006年第1期123-128,共6页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China（No.90104004, No.60373059）.

摘　　要：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.

关 键 词：Hyperelliptic curves CRYPTOSYSTEMS Divisor scalar multiplications Binary method Frobenlus endomorphism Characteristic polynomial 

分 类 号：TN918[电子电信—通信与信息系统]