Related papers: Using Fricke modular polynomials to compute isogen…

The main goal of this paper is to determine for which prime numbers $r\geq 3$ can an elliptic curve~$E$ defined over $\mathbb Q$ have an $r$-isogeny over $\mathbb Q(\zeta_r)$. We study this question under various assumptions on the…

Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…

For $E_1$ and $E_2$ elliptic curves defined over a number field $K$, without complex multiplication, we consider the function ${\mathcal{F}}_{E_1, E_2}(x)$ counting non-zero prime ideals $\mathfrak{p}$ of the ring of integers of $K$, of…

We study $\ell$-isogeny graphs of ordinary elliptic curves defined over $\mathbb{F}_q$ with an added level structure. Given an integer $N$ coprime to $p$ and $\ell,$ we look at the graphs obtained by adding $\Gamma_0(N),$ $\Gamma_1(N),$ and…

Let $E$ be an elliptic curve defined over $\mathbb Q$ and $\widetilde{E}_p$ denote the reduction of $E$ modulo a prime $p$ of good reduction for $E$. The divisibility of $|\widetilde{E}_{p}(\mathbb{F}_p)|$ by an integer $m\ge 2$ for a set…

By reformulating and extending results of Elkies, we prove some results on $\mathbb Q$-curves over number fields of odd degree. We show that, over such fields, the only prime isogeny degrees~$\ell$ which an elliptic curve without CM may…

Let $E$ be an ordinary elliptic curve over a finite field and $g$ be a positive integer. Under some technical assumptions, we give an algorithm to span the isomorphism classes of principally polarized abelian varieties in the isogeny class…

The classical modular polynomials $\Phi_\ell(X,Y)$ give plane curve models for the modular curves $X_0(\ell)/\mathbb{Q}$ and have been extensively studied. In this article, we provide closed formulas for $\ell$ nontrivial coefficients of…

We present an algorithm solving the following problem: given two genus 2 curves over a field k with isogenous Jacobians, compute such an isogeny explicitly. This isogeny can be either an l-isogeny or, in the real multiplication case, an…

We present e cient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny…

We provide explicit bounds on the difference of heights of the $j$-invariants of isogenous elliptic curves defined over $\overline{\mathbb{Q}}$. The first one is reminiscent of a classical estimate for the Faltings height of isogenous…

Consider the family of elliptic curves $E_n:y^2=x^3+n^2$, where $n$ varies over positive cubefree integers. There is a rational $3$-isogeny $\phi$ from $E_n$ to $\hat{E}_n:y^2=x^3-27n^2$ and a dual isogeny $\hat{\phi}:\hat{E}_n\rightarrow…

Let $p$ be an odd prime number and be an integer coprime to $p$. We survey an algorithm for computing explicit rational representations of $(\ell,...,\ell)$-isogenies between Jacobians of hyperelliptic curves of arbitrary genus over an…

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…

For a prime $p{\,>\,}3$ and a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$ with ${j(E)\notin\{0,1728\}}$, consider an endomorphism $\alpha$ of $E$ represented as a composition of $L$ isogenies of degree at most $d$. We…

Given two CM elliptic curves over a number field and a natural number $m$, we establish a polynomial lower bound (in terms of $m$) for the number of rational primes $p$ such that the reductions of these elliptic curves modulo a prime above…

This is a sequel to the paper [F. Breuer, H.-G. R\"uck, Drinfeld modular polynomials in higher rank, J. Number Theory 129 (2009), 59-83.], in which we introduced Drinfeld modular polynomials of higher rank, using an analytic construction.…

We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…

In the first part of the paper, we fix a non-CM elliptic curve $E/\mathbb{Q}$ and an odd prime $\ell$ and investigate the distribution of invariants associated to the $\ell$-volcano containing the reduction $E_p$, as $p$ ranges over primes…

For each $t\in\mathbb{Q}\setminus\{-1,0,1\}$, define an elliptic curve over $\mathbb{Q}$ by \begin{align*} E_t:y^2=x(x+1)(x+t^2). \end{align*} Using a formula for the root number $W(E_t)$ as a function of $t$ and assuming some standard…