computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications计算类的特征多项式的超椭圆曲线密码的应用程序.pdfVIP

Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2011, Article ID 437541, 25 pages doi:10.1155/2011/437541 Research Article Computing the Characteristic Polynomials of a Class of Hyperelliptic Curves for Cryptographic Applications Lin You,1, 2 Guangguo Han,1 Jiwen Zeng,3 and Yongxuan Sang1 1 College of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China 2 College of Engineering and Science, Clemson University, Clemson, SC 29631, USA 3 School of Mathematical Sciences, Xiamen University, Xiamen 361005, China Correspondence should be addressed to Lin You, lyou@ Received 12 November 2010; Accepted 21 March 2011 Academic Editor: J. Rodellar Copyright q 2011 Lin You et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Hyperelliptic curves have been widely studied for cryptographic applications, and some special hyperelliptic curves are often considered to be used in practical cryptosystems. Computing Jacobian group orders is an important operation in constructing hyperelliptic curve cryptosystems, and the most common method used for the computation of Jacobian group orders is by computing the zeta functions or the characteristic polynomials of the related hyperelliptic curves. For the hyperelliptic curve Cq : v2 up au b over the field q with q being a power of an odd prime p, Duursma and Sakurai obtained its characteristic polynomial for q p, a −1, and b ∈ p . In this paper, we determine the characteristic polynomials of Cq over the finite field pn for n 1, 2 and a, b ∈ Fpn . We also give some computation