|
University of SydneySchool of Mathematics and StatisticsAlgebraic Geometry Seminar10.05 - 10.55 (+ epilogue until 11.30) in Carslaw 709 on Friday 22 November
David Kohel$p$-Adic Point Counting Algorithms for Elliptic CurvesIn this talk I will discuss generalizations of the recent AGM algorithm for determining the zeta function of an elliptic curve over F2n. This class of algorithms work for elliptic curves over proper extensions of the prime field in any characteristic p. First I will describe the parametrization of elliptic curves by a class of curves X0(pr). The latter curves are course moduli spaces for elliptic curves with pr-isogeny structure. I make this explicit for the the case pr = 8 which gives rise to the AGM algorithm. By computing the pullback of an explicit isogeny between these parametrized modular curves we should how to obtain a representation of the endomorphism ring in the base ring of the curve.
As a second step I will explain how the elliptic curve E/Fq can be
replaced by a representative Heegner point on a modular curve
X0(pr), and how this is connected to the endomorphism ring structure
of E/Fq, and to a Galois cycle of isogenies
Combining the first and second steps of this construction yields a solution to the problem of determining the zeta function of the elliptic curve from the p-adic lift of the Heegner points. The resulting algorithms, denoted AGM-X0(pr), generalize the AGM algorithm and provide an efficient solution to the determination of the zeta function of an elliptic curve over any proper extension Fq of a small prime field Fp.
File translated from TEX by TTH, version 3.00. On 20 Nov 2002, 09:49. |