Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEndomorphism rings of reductions of elliptic curves and abelian varieties
198
0
0.0
(
0
)
Authors
Yuri G. Zarhin
Ask ChatGPT about the research
No Arabic abstract
Let $E$ be an elliptic curve without CM that is defined over a number field $K$. For all but finitely many nonarchimedean places $v$ of $K$ there is the reduction $E(v)$ of $E$ at $v$ that is an elliptic curve over the residue field $k(v)$ at $v$. The set of $v$s with ordinary $E(v)$ has density 1 (Serre). For such $v$ the endomorphism ring $End(E(v))$ of $E(v)$ is an order in an imaginary quadratic field. We prove that for any pair of relatively prime positive integers $N$ and $M$ there are infinitely many nonarchimedean places $v$ of $K$ such that the discriminant $Delta(v)$ of $End(E(v))$ is divisible by $N$ and the ratio $Delta(v)/N$ is relatively prime to $NM$. We also discuss similar questions for reductions of abelian varieties. The subject of this paper was inspired by an exercise in Serres Abelian $ell$-adic representations and elliptic curves and questions of Mihran Papikian and Alina Cojocaru.
rate research
Read More
Computing endomorphism rings of supersingular elliptic curves is an important problem in computational number theory, and it is also closely connected to the security of some of the recently proposed isogeny-based cryptosystems. In this paper we give a new algorithm for computing the endomorphism ring of a supersingular elliptic curve $E$ that runs, under certain heuristics, in time $O((log p)^2p^{1/2})$. The algorithm works by first finding two cycles of a certain form in the supersingular $ell$-isogeny graph $G(p,ell)$, generating an order $Lambda subseteq operatorname{End}(E)$. Then all maximal orders containing $Lambda$ are computed, extending work of Voight. The final step is to determine which of these maximal orders is the endomorphism ring. As part of the cycle finding algorithm, we give a lower bound on the set of all $j$-invariants $j$ that are adjacent to $j^p$ in $G(p,ell)$, answering a question in arXiv:1909.07779.
Let $Y$ be a principal homogeneous space of an abelian surface, or a K3 surface, over a finitely generated extension of $mathbb{Q}$. In 2008, Skorobogatov and Zarhin showed that the Brauer group modulo algebraic classes $text{Br}, Y/ text{Br}_1, Y$ is finite. We study this quotient for the family of surfaces that are geometrically isomorphic to a product of isogenous non-CM elliptic curves, as well as the related family of geometrically Kummer surfaces; both families can be characterized by their geometric Neron-Severi lattices. Over a field of characteristic $0$, we prove that the existence of a strong uniform bound on the size of the odd-torsion of $text{Br}, Y / text{Br}_1, Y$ is equivalent to the existence of a strong uniform bound on integers $n$ for which there exist non-CM elliptic curves with abelian $n$-division fields. Using the same methods we show that, for a fixed prime $p$, a number field $k$ of fixed degree $r$, and a fixed discriminant of the geometric Neron-Severi lattice, $(text{Br}, Y / text{Br}_1, Y)[p^infty]$ is bounded by a constant that depends only on $p$, $r$, and the discriminant.
We prove two theorems concerning isogenies of elliptic curves over function fields. The first one describes the variation of the height of the $j$-invariant in an isogeny class. The second one is an isogeny estimate, providing an explicit bound on the degree of a minimal isogeny between two isogenous elliptic curves. We also give several corollaries of these two results.
A cycle of elliptic curves is a list of elliptic curves over finite fields such that the number of points on one curve is equal to the size of the field of definition of the next, in a cyclic way. We study cycles of elliptic curves in which every curve is pairing-friendly. These have recently found notable applications in pairing-based cryptography, for instance in improving the scalability of distributed ledger technologies. We construct a new cycle of length 4 consisting of MNT curves, and characterize all the possibilities for cycles consisting of MNT curves. We rule out cycles of length 2 for particular choices of small embedding degrees. We show that long cycles cannot be constructed from families of curves with the same complex multiplication discriminant, and that cycles of composite order elliptic curves cannot exist. We show that there are no cycles consisting of curves from only the Freeman or Barreto--Naehrig families.
This is an introduction to a probabilistic model for the arithmetic of elliptic curves, a model developed in a series of articles of the author with Bhargava, Kane, Lenstra, Park, Rains, Voight, and Wood. We discuss the theoretical evidence for the model, and we make predictions about elliptic curves based on corresponding theorems proved about the model. In particular, the model suggests that all but finitely many elliptic curves over $mathbb{Q}$ have rank $le 21$, which would imply that the rank is uniformly bounded.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
