Deterministically generating Picard groups of hyperelliptic curves over finite fields

preprint2014arXivOpen access

Abstract

Let ε>0ε>0. In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve CC of genus gg over a finite field kk of cardinality qq given by y2+h(x)y=f(x)y^2+h(x)y=f(x) such that the xx-coordinate map is ramified at ∞\infty. In time O(g2+εq1/2+ε)O(g^{2+ε} q^{1/2+ε}) the algorithm outputs a set of generators of the Picard group Pick0(C)\mathrm{Pic}^0_k(C). This extends results which others have obtained when g=1g=1. In this article we introduce a combinatorial tool, the `shape parameter', which we use together with character sum estimates from class field theory to deduce the statement.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.