Deterministically generating Picard groups of hyperelliptic curves over finite fields
From MaRDI portal
(Redirected from Publication:897576)
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.
Recommendations
- Linearizing torsion classes in the Picard group of algebraic curves over finite fields
- Computing in Picard groups of projective curves over finite fields
- Point counting on Picard curves in large characteristic
- A quasi quadratic time algorithm for hyperelliptic curve point counting
- scientific article; zbMATH DE number 176556
Cites work
- scientific article; zbMATH DE number 1643940 (Why is no real title available?)
- scientific article; zbMATH DE number 1716471 (Why is no real title available?)
- scientific article; zbMATH DE number 3657912 (Why is no real title available?)
- scientific article; zbMATH DE number 1748084 (Why is no real title available?)
- Algebraic Function Fields and Codes
- Class field theory
- Deterministic equation solving over finite fields
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- On finding primitive roots in finite fields
Cited in
(3)
This page was built for publication: Deterministically generating Picard groups of hyperelliptic curves over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897576)