Related papers: Using Fricke modular polynomials to compute isogen…
We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…
We study the modular curves defined by Weber functions, and associated modular polynomials, action of $\mathrm{SL}_2(\mathbb{Z})$, and parametrizations of elliptic curves with a view to the study of the isogeny graphs that they determine,…
We give explicit upper and lower bounds on the size of the coefficients of the modular polynomials $\Phi_N$ for the elliptic $j$-function. These bounds make explicit the best previously known asymptotic bounds. We then give an explicit…
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of…
Given an elliptic curve $E$ over a finite field $\F_q$ of $q$ elements, we say that an odd prime $\ell \nmid q$ is an Elkies prime for $E$ if $t_E^2 - 4q$ is a quadratic residue modulo $\ell$, where $t_E = q+1 - #E(\F_q)$ and $#E(\F_q)$ is…
Soit l un entier et E_{c,l} la famille de Kubert des courbes elliptiques definies sur Q munies d'un point rationnel A d'ordre l. On note F_{c,l} la courbe elliptique quotient de E_{c,l} par le groupe engendre' par A, et f_l l'isogenie de…
Let q be a prime power and E a non-isotrivial elliptic curve over Fq(T) given by a Weierstrass model. We survey the construction, with an explicit point of view, of the modular parametrization of E by the associated Drinfeld modular curve.…
In this paper, we introduce the study of minimal torsion curves within a fixed geometric isogeny class. For a $\overline{\mathbb{Q}}$-isogeny class $\mathcal{E}$ of elliptic curves and $N \in \mathbb{Z}^+$, we wish to determine the least…
We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…
Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each element of $\mathcal{E}$ and an edge for each…
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…
Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…
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 will describe an algorithm to construct an elliptic curve $E_{f_q}$ over some prime field $\mathbb{F}_p$ such that such that $|E_{f_q}(\mathbb{F}_p)| = f_q$, where $f_q$ is a probable Fibonacci prime for some prime index $q$. The…
Let $N>1$ and let $\Phi_N(X,Y)\in\mathbb{Z}[X,Y]$ be the modular polynomial which vanishes precisely at pairs of $j$-invariants of elliptic curves linked by a cyclic isogeny of degree $N$. In this note we study the divisibility of the…
Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…
Given an integer $D$ and an ordinary isogeny class of abelian varieties defined over a finite field $\mathbb{F}_q$ with commutative $\mathbb{F}_q$-endomorphism algebra, we provide algorithms for computing all isogenies of degree dividing…
In this paper we extend a previous investigation by us regarding an iterative construction of irreducible polynomials over finite fields of odd characteristic. In particular, we show how it is possible to iteratively construct irreducible…