Computing in Picard groups of projective curves over finite fields
From MaRDI portal
Abstract: We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations can be done efficiently in this setting: decomposing divisors into prime divisors; computing pull-backs and push-forwards of divisors under finite morphisms, and hence Picard and Albanese maps on Jacobians; generating uniformly random divisors and points on Jacobians; computing Frobenius maps and Kummer maps; and finding a basis for the -torsion of the Picard group, where is a prime number different from the characteristic of the base field.
Recommendations
- Linearizing torsion classes in the Picard group of algebraic curves over finite fields
- Linear algebra algorithms for divisors on an algebraic curve
- On Jacobian group arithmetic for typical divisors on curves
- Point counting on Picard curves in large characteristic
- scientific article; zbMATH DE number 1461527
Cites work
- A new proof for the non-degeneracy of the Frey-Rück pairing and a connection to isogenies over the base field
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Asymptotically fast group operations on Jacobians of general curves
- Efficient decomposition of associative algebras over finite fields
- scientific article; zbMATH DE number 6696214 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 529172 (Why is no real title available?)
- Linear algebra algorithms for divisors on an algebraic curve
- Linearizing torsion classes in the Picard group of algebraic curves over finite fields
- Modular forms and calculations in Galois theory
- Modular forms, a computational approach. With an appendix by Paul E. Gunnells
- On the discrete logarithm problem in class groups of curves
- Probabilistic Algorithms in Finite Fields
- Symmetric Products and Jacobians
Cited in
(8)- Linearizing torsion classes in the Picard group of algebraic curves over finite fields
- Moduli-friendly Eisenstein series over the \(p\)-adics and the computation of modular Galois representations
- Computing unit groups of curves
- Bounding Picard numbers of surfaces using \(p\)-adic cohomology
- Group Law Algorithms for Jacobian Varieties of Curves over Finite Fields
- scientific article; zbMATH DE number 1461527 (Why is no real title available?)
- Hensel-lifting torsion points on Jacobians and Galois representations
- Deterministically generating Picard groups of hyperelliptic curves over finite fields
This page was built for publication: Computing in Picard groups of projective curves over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840629)