Abstract
Let . In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve of genus over a finite field of cardinality given by such that the -coordinate map is ramified at . In time the algorithm outputs a set of generators of the Picard group . This extends results which others have obtained when . 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.