Descent Via Isogeny on Elliptic Curves with Large Rational Torsion Subgroups.

We outline PARI programs which assist with various algorithms related to descent via isogeny on elliptic curves. We describe, in this context, variations of standard inequalities which aid the computation of members of the Tate-Shafarevich group. We apply these techniques to several examples: in one case we use descent via 9-isogeny to determine the rank of an elliptic curve; in another case we find nontrivial members of the 9-part of the Tate-Shafarevich group, and in a further case, nontrivial members of the 13-part of the Tate-Shafarevich group

Explicit isogeny descent on elliptic curves

In this note, we consider an l-isogeny descent on a pair of elliptic curves over Q. We assume that l > 3 is a prime. The main result expresses the relevant Selmer groups as kernels of simple explicit maps between finite- dimensional F_l-vector spaces defined in terms of the splitting fields of the kernels of the two isogenies. We give examples of proving the l-part of the Birch and Swinnerton-Dyer conjectural formula for certain curves of small conductor.Comment: 17 pages, accepted for publication in Mathematics of Computatio

A table of elliptic curves over the cubic field of discriminant -23

Let F be the cubic field of discriminant -23 and O its ring of integers. Let Gamma be the arithmetic group GL_2 (O), and for any ideal n subset O let Gamma_0 (n) be the congruence subgroup of level n. In a previous paper, two of us (PG and DY) computed the cohomology of various Gamma_0 (n), along with the action of the Hecke operators. The goal of that paper was to test the modularity of elliptic curves over F. In the present paper, we complement and extend this prior work in two ways. First, we tabulate more elliptic curves than were found in our prior work by using various heuristics ("old and new" cohomology classes, dimensions of Eisenstein subspaces) to predict the existence of elliptic curves of various conductors, and then by using more sophisticated search techniques (for instance, torsion subgroups, twisting, and the Cremona-Lingham algorithm) to find them. We then compute further invariants of these curves, such as their rank and representatives of all isogeny classes. Our enumeration includes conjecturally the first elliptic curves of ranks 1 and 2 over this field, which occur at levels of norm 719 and 9173 respectively

Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic

The problem of computing an explicit isogeny between two given elliptic curves over F_q, originally motivated by point counting, has recently awaken new interest in the cryptology community thanks to the works of Teske and Rostovstev & Stolbunov. While the large characteristic case is well understood, only suboptimal algorithms are known in small characteristic; they are due to Couveignes, Lercier, Lercier & Joux and Lercier & Sirvent. In this paper we discuss the differences between them and run some comparative experiments. We also present the first complete implementation of Couveignes' second algorithm and present improvements that make it the algorithm having the best asymptotic complexity in the degree of the isogeny.Comment: 21 pages, 6 figures, 1 table. Submitted to J. Number Theor