Related papers: Radical isogenies and modular curves
Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same…
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…
The modular curve X_0(N) parametrizes elliptic curves together with a cyclic subgroup of order N, and hence cyclic N-isogenies. While explicit moduli descriptions of X_1(N) are well developed, a comparable construction for X_0(N) has…
Elliptic $K$-curves are elliptic curves defined over some field extension $L/K$ that are isogenous to all of their Galois conjugates. We present a new result on $K$-curves $E$ that are given by a $K$-rational orbit $\{\tau, -1/N\tau\}$ of…
The remarkable structure and computationally explicit form of isogeny graphs of elliptic curves over a finite field has made them an important tool for computational number theorists and practitioners of elliptic curve cryptography. This…
We consider finite graphs whose vertexes are supersingular elliptic curves, possibly with level structure, and edges are isogenies. They can be applied to the study of modular forms and to isogeny based cryptography. The main result of this…
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…
Let $E$ be an elliptic curve over a number field $K$. If for almost all primes of $K$, the reduction of $E$ modulo that prime has rational cyclic isogeny of fixed degree, we can ask if this forces $E$ to have a cyclic isogeny of that degree…
Let $\mathcal{O}$ be an order in the imaginary quadratic field $K$. For positive integers $M \mid N$, we determine the least degree of an $\mathcal{O}$-CM point on the modular curve $X(M,N)_{/K(\zeta_M)}$ and also on the modular curve…
Let K be a number field and E/K a modular elliptic curve, with modular parametrization $X_0(N) \to E$ defined over K. The purpose of this note is to study the images in E of classes of isogenous points in X_0(N).
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…
We describe and compare algorithms for computing supersingular isogeny graphs. Along the way, we obtain a formula for the trace of the adjacency matrix of a general supersingular isogeny graph, and we prove a conjecture recently posed by…
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…
Isogeny volcanoes are graphs whose vertices are elliptic curves and whose edges are $\ell$-isogenies. Algorithms allowing to travel on these graphs were developed by Kohel in his thesis (1996) and later on, by Fouquet and Morain (2001).…
Let $\mathcal{E}$ be an elliptic curve over a field $K$ and $\ell$ a prime. There exists an elliptic curve $\mathcal{E}^*$ related to $\mathcal{E}$ by anisogeny (rational map that is also a group homomorphisms) of degree $\ell$ if and only…
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…
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…
An isogeny graph is a graph whose vertices are principally polarized abelian varieties and whose edges are isogenies between these varieties. In his thesis, Kohel described the structure of isogeny graphs for elliptic curves and showed that…
The linearity defect, introduced by Herzog and Iyengar, is a numerical measure for the complexity of minimal free resolutions. Employing a characterization of the linearity defect due to \c{S}ega, we study the behavior of linearity defect…