A new scalar multiplication method suitable for hyperelliptic curve cryptosystems

Authors:
Chen Xiao-e;You Lin
Affiliations:
School of Mathematics and Statistics, Hainan Nonnal University, Haikou, China;School of Communication Engineering, Hangzhou Dianzi University, Hangzhou, China
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Year:
2009

Citing 4
Cited 0

Hyperelliptic cryptosystems

Journal of Cryptology
Counting Points on Hyperelliptic Curves over Finite Fields

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Algebraic Function Fields and Codes

Algebraic Function Fields and Codes
Efficient doubling on genus two curves over binary fields

SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography

Quantified Score

Hi-index	0.02

Visualization

Abstract

We describe a new scalar multiplication method for hyperelliptic curve cryptosystems. The method is obtained by the decomposition of the divisor into the simple divisors. The comparison results show that our method is much more efficient than Frobenius method and Double-and-Add method for some special hyperelliptic curves.