Abstract:
Using hyperelliptic curves in cryptography requires the computation of the Jacobian order of a curve. This is equivalent to computing the characteristic polynomial of Frobenius χ(λ)∈Z[λ]. By calculating Cartier–Manin matrix, we can recover the polynomial χ(λ) modulo the characteristic of the base field. This information can further be used for recovering full polynomial in combination with other methods. In this paper, we investigate the hyperelliptic curves of the form C1:y2=x2g+1+axg+1+bx and C2:y2=x2g+2+axg+1+b over the finite field Fq, q=pn, p>2. We transform these curves to the form C1,ρ:y2=x2g+1−2ρxg+1+x and C2,ρ:y2=x2g+2−2ρxg+1+1, where ρ=−a/(2√b), and prove that the coefficients of the corresponding Cartier–Manin matrices for the curves in this form are Legendre polynomials. As a consequence, the matrices are centrosymmetric and therefore, for finding the matrix, it's enough to compute a half of coefficients. Cartier–Manin matrices are determined up to a transformation of the form S(p)WS−1. It is known that centrosymmetric matrices can be transformed to the block-diagonal form by an orthogonal transformation. We prove that this transformation can be modified to have a form S(p)WS−1 and be defined over the base field of the curve. Therefore, Cartier–Manin matrices of curves C1,ρ and C2,ρ are equivalent to block-diagonal matrices. In the case of gcd(p,g)=1, Miller and Lubin proved that the matrices of curves C1 and C2 are monomial. We prove that the polynomial χ(λ)(modp) can be found in factored form in terms of Legendre polynomials by using permutation attached to the monomial matrix. As an application of our results, we list all possible polynomials χ(λ)(modp) in the case of gcd(p,g)=1, g is from 2 to 7 and the curve C1 is over Fp if √b∈Fp and over Fp2 if √b∉Fp.
This publication is cited in the following 4 articles:
Yu. F. Boltnev, S. A. Novoselov, V. A. Osipov, “O postroenii maksimalnykh giperellipticheskikh krivykh roda 3”, PDM. Prilozhenie, 2021, no. 14, 24–30
S. A. Novoselov, “Counting points on hyperelliptic curves of type Y(2) = x(2g)(+1)+ax(g+1) + bx”, Finite Fields their Appl., 68 (2020), 101757
E. M. Melnichuk, S. A. Novoselov, “Kharakteristicheskie mnogochleny nekotorykh giperellipticheskikh krivykh rodov 2,3 i p-ranga 1”, PDM. Prilozhenie, 2019, no. 12, 21–24
S. A. Novoselov, “Counting points on hyperelliptic curves of type y2=x2g+1+axg+1+bx”, PDM. Prilozhenie, 2018, no. 11, 30–33