Finite Fields and Their Applications ( IF 1.2 ) Pub Date : 2020-09-25 , DOI: 10.1016/j.ffa.2020.101757 S.A. Novoselov
In this work, we investigate hyperelliptic curves of type over the finite field . For the case of we propose an algorithm to compute the number of points on the Jacobian of the curve with complexity over . In case of we present a point counting algorithm with complexity over . The Jacobian splits over an extension of the field on the Jacobians of the curves defined by the Dickson polynomials of degree g. For these curves of genus with equation and curves of genus with equation , we give the lists of possible characteristic polynomials of the Frobenius endomorphism modulo p.
中文翻译:
y 2 = x 2 g +1 + ax g +1 + bx类型的超椭圆曲线上的计数点
在这项工作中,我们研究了类型的超椭圆曲线 在有限域上 。对于 我们提出一种算法来计算复杂度曲线的雅可比点的数量 过度 。的情况下 我们提出一种复杂的点数算法 过度 。雅可比 拆分字段的扩展 在由Dickson多项式定义的曲线的Jacobian上 度g。对于这些属的曲线 与方程式 和属的曲线 与方程式 ,我们给出了Frobenius同态模p的可能特征多项式的列表。