A Fast Exponent Arithmetic of Hyperelliptic Curves Cryptosystrm
一种超椭圆曲线密码体制的快速求阶算法

The maths theory of hyperelliptic curves cryptosystem(HCC)is expatiated in this article while the arithmetic of HCC Jacobian addition is also set forth, and its correctness is proved by examples. A HC parameter is signed, and its strict express arithmetic is realized based on ECC and international standards which adapt to figure HC in cryptosystrm and count exponent of Jacobian. This arithmetic gives more aid for the selection of secure HC.