Counting Points for Hyperelliptic Curves of Type y2= x5 + ax over Finite Prime Fields

Counting rational points on Jacobian varieties of hyperelliptic curves over finite fields is very important for constructing hyperelliptic curve cryptosystems (HCC), but known algorithms for general curves over given large prime fields need very long running time. In this article, we propose an extremely fast point counting algorithm for hyperelliptic curves of type y 2=x 5+ax over given large prime fields \(\mathbb{F}_{p}\), e.g. 80-bit fields. For these curves, we also determine the necessary condition to be suitable for HCC, that is, to satisfy that the order of the Jacobian group is of the form l· c where l is a prime number greater than about 2160 and c is a very small integer. We show some examples of suitable curves for HCC obtained by using our algorithm. We also treat curves of type y 2=x 5+a where a is not square in \(\mathbb{F}_{p}\).

[1]  Neal Koblitz,et al.  Algebraic aspects of cryptography , 1998, Algorithms and computation in mathematics.

[2]  D. Cantor.  Computing in the Jacobian of a hyperelliptic curve , 1987 .

[3]  D. Mumford.  Tata Lectures on Theta I , 1982 .

[4]  G. Frey,et al.  A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .

[5]  K. Williams,et al.  Gauss and Jacobi sums , 2021, Mathematical Surveys and Monographs.

[6]  W. J. Harvey,et al.  TATA LECTURES ON THETA I (Progress in Mathematics, 28) , 1986 .

[7]  Chaoping Xing.  On Supersingular Abelian Varieties of Dimension Two over Finite Fields , 1996 .

[8]  Stephen Wolfram,et al.  The Mathematica Book , 1996 .

[9]  Kazuto Matsuo,et al.  An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields , 2002, ANTS.

[10]  N. Yui.  On the Jacobian varieties of hyperelliptic curves over fields of characteristic p > 2 , 1978 .

[11]  YoungJu Choie,et al.  Supersingular hyperelliptic curves of genus 2 over finite fields , 2005, Appl. Math. Comput..

[12]  Richard H. Hudson,et al.  Binomial coefficients and Jacobi sums , 1984 .

[13]  YoungJu Choie,et al.  Supersingular Hyperelliptic Curve of Genus 2 over Finite Fields , 2002, IACR Cryptol. ePrint Arch..

[14]  Steven D. Galbraith,et al.  Supersingular Curves in Cryptography , 2001, ASIACRYPT.

[15]  Robert Harley,et al.  Counting Points on Hyperelliptic Curves over Finite Fields , 2000, ANTS.

[16]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[17]  Stephen Wolfram,et al.  The Mathematica book (4th edition) , 1999 .

[18]  W. J. Harvey,et al.  THE COMPLEX ANALYTIC THEORY OF TEICHMÜLLER SPACES (Canadian Mathematical Society Series of Monographs and Advanced Texts) , 1991 .

[19]  J. Tate.  Endomorphisms of abelian varieties over finite fields , 1966 .

[20]  W. Waterhouse,et al.  Abelian varieties over finite fields , 1969 .

[21]  N. Koblitz,et al.  Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems , 1998, Bulletin of the Australian Mathematical Society.

[22]  Hans-Georg Rück.  Abelian surfaces and jacobian varieties over finite fields , 1990 .

[23]  Iwan M. Duursma,et al.  Speeding up the Discrete Log Computation on Curves with Automorphisms , 1999, ASIACRYPT.

[24]  J. Manin,et al.  THE HASSE-WITT MATRIX OF AN ALGEBRAIC CURVE , 1996 .

[25]  Franck Leprévost,et al.  Revêtements de courbes elliptiques à multiplication complexe par des courbes hyperelliptiques et sommes de caractères , 1997 .