Computing endomorphism rings of Jacobians of genus 2 curves over finite fields

DOI10.1142/9789812793430_0002MaRDI QIDQ3545345zbMATH OpenOpenAlexFDO

Authors

Publication date 10 December 2008

Published in Algebraic Geometry and Its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0701305

zbMATH Keywords

probabilistic algorithmsaction of Frobeniuscomputing of the field of definitionendomorphism ring of the Jacobianimplementation of Eisenträger and Lauter's algorithm for computing Igusa class polynomialssubgroups for prime powers

Mathematics Subject Classification ID

Randomized algorithms (68W20) Jacobians, Prym varieties (14H40) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Abstract: We present algorithms which, given a genus 2 curve $C$ defined over a finite field and a quartic CM field $K$, determine whether the endomorphism ring of the Jacobian $J$ of $C$ is the full ring of integers in $K$. In particular, we present probabilistic algorithms for computing the field of definition of, and the action of Frobenius on, the subgroups $J[el{l}^d]$ for prime powers $el{l}^d$. We use these algorithms to create the first implementation of Eisentr"ager and Lauter's algorithm for computing Igusa class polynomials via the Chinese Remainder Theorem cite{el}, and we demonstrate the algorithm for a few small examples. We observe that in practice the running time of the CRT algorithm is dominated not by the endomorphism ring computation but rather by the need to compute $p^3$ curves for many small primes $p$.

Recommendations

• Computing the geometric endomorphism ring of a genus-2 Jacobian
• Numerical computation of endomorphism rings of Jacobians
• Computing endomorphism rings of abelian varieties of dimension two
• Rigorous computation of the endomorphism ring of a Jacobian
• Computing the endomorphism ring of an ordinary abelian surface over a finite field

Cited in

(20)

• Subrings of \(p\)-power index in endomorphism rings of simple abelian varieties over finite fields
• Pairing the volcano
• Computing (\ell ,\ell )-isogenies in polynomial time on Jacobians of genus 2 curves
• Constructing Picard curves with complex multiplication using the Chinese remainder theorem
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• On the 2-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
• Computing endomorphism rings of abelian varieties of dimension two
• The probability of non-isomorphic group structures of isogenous elliptic curves in finite field extensions. I
• Dynamics on abelian varieties in positive characteristic
• Computing the endomorphism ring of an elliptic curve over a number field
• Rigorous computation of the endomorphism ring of a Jacobian
• An algorithm to compute the number of points on elliptic curves of j-invariant 0 or 1728 over a finite field
• Linearizing torsion classes in the Picard group of algebraic curves over finite fields
• Constructing elliptic curves and curves of genus 2 over finite fields
• Efficient algorithms for the detection of (N, N)-splittings and endomorphisms
• Numerical computation of endomorphism rings of Jacobians
• Computing Humbert surfaces and applications
• On the \({\ell}\)-adic valuation of the cardinality of elliptic curves over finite extensions of \(\mathbb{F}_{q}\)
• Computing the geometric endomorphism ring of a genus-2 Jacobian
• Isogeny graphs of ordinary abelian varieties

This page was built for publication: Computing endomorphism rings of Jacobians of genus 2 curves over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545345)