Related papers: Explicit isogenies of prime degree over number fie…

We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…

Given an elliptic curve $E$ over a finite field $\mathbb{F}_q$ we study the finite extensions $\mathbb{F}_{q^n}$ of $\mathbb{F}_q$ such that the number of $\mathbb{F}_{q^n}$-rational points on $E$ attains the Hasse upper bound. We obtain an…

We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…

We provide a framework for using elliptic curves with complex multiplication to determine the primality or compositeness of integers that lie in special sequences, in deterministic quasi-quadratic time. We use this to find large primes,…

Motivated by recent work of Florian Pop, we study the connections between three notions of equivalence of function fields: isomorphism, elementary equivalence, and the condition that each of a pair of fields can be embedded in the other,…

Let E and E' be two elliptic curves over a number field. We prove that the reductions of E and E' at a finite place p are geometrically isogenous for infinitely many p, and draw consequences for the existence of supersingular primes. This…

We study monogenity of pure cubic number fields by means of Selmer groups of certain elliptic curves. A cubic number field with discriminant $D$ determines a unique nontrivial $\mathbb{F}_3$-orbit in the first cohomology group of the…

A prime geodesic theorem for singular geodesics in a locally symmetric space is proved. As an application, an asymptotic formula for units in number fields is given.

We introduce a special class of supersingular curves over $\mathbb{F}_{p^2}$, characterized by the existence of non-integer endomorphisms of small degree. A number of properties of this set is proved. Most notably, we show that when this…

Let $K$ be a field of characteristic different from $2$, $\bar{K}$ its algebraic closure. Let $n \ge 3$ be an odd integer. Let $f(x)$ and $h(x)$ be degree $n$ polynomials with coefficients in $K$ and without repeated roots. Let us consider…

A classical result of Dirichlet shows that certain elementary character sums compute class numbers of quadratic imaginary number fields. We obtain analogous relations between class numbers and a weighted character sum associated to a…

Let K be a number field. We consider a local-global principle for elliptic curves E/K that admit (or do not admit) a rational isogeny of prime degree n. For suitable K (including K=Q), we prove that this principle holds when n = 1 mod 4,…

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

For the elliptic curves $E_{\sigma 2D} : y^2 = x^3 + \sigma 2Dx$ , which has 2-isogeny curve $E'_{\sigma 2D} : y^2 = x^3 -\sigma 8Dx$, $\sigma = \pm 1,\ D = p_1^{e_1}p_2^{e_2}\cdots p_n^{e_n}$, where $p_i$ are different odd prime numbers…

In this paper we prove some divisibility properties of the cardinality of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of the elliptic…

Isogenies occur throughout the theory of elliptic curves. Recently, the cryptographic protocols based on isogenies are considered as candidates of quantum-resistant cryptographic protocols. Given two elliptic curves $E_1, E_2$ defined over…

Let p>3 be a prime and let E, E' be supersingular elliptic curves over F_p. We want to construct an isogeny phi: E --> E'. The currently fastest algorithm for finding isogenies between supersingular elliptic curves solves this problem by…

Let K be a number field, and let E be an elliptic curve over K. A famous result by Faltings of 1983 can be reformulated for elliptic curves as follows: if S is a set of primes of good reduction for E having density one, then the K-isogeny…

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

Fix an elliptic curve $E_0$ without CM and a non-isotrivial elliptic scheme over a smooth irreducible curve, both defined over the algebraic numbers. Consider the union of all images of a fixed finite-rank subgroup (of arbitrary rank) of…