English
Related papers

Related papers: Explicit isogenies in quadratic time in any charac…

200 papers

We establish a congruence formula between $p$-adic logarithms of Heegner points for two elliptic curves with the same mod $p$ Galois representation. As a first application, we use the congruence formula when $p=2$ to explicitly construct…

Number Theory · Mathematics 2017-11-29 Daniel Kriz , Chao Li

We describe an efficient algorithm for the computation of separable isogenies between abelian varieties represented in the coordinate system given by algebraic theta functions. Let $A$ be an abelian variety of dimension $g$ defined over a…

Algebraic Geometry · Mathematics 2019-02-20 David Lubicz , Damien Robert

We present two algorithms to compute the endomorphism ring of an ordinary elliptic curve E defined over a finite field F_q. Under suitable heuristic assumptions, both have subexponential complexity. We bound the complexity of the first…

Number Theory · Mathematics 2012-06-26 Gaetan Bisson , Andrew V. Sutherland

We present a heuristic asymptotic formula as $x\to \infty$ for the number of isogeny classes of pairing-friendly elliptic curves with fixed embedding degree $k\geq 3$, with fixed discriminant, with rho-value bounded by a fixed $\rho_0$ such…

Number Theory · Mathematics 2012-04-03 John Boxall

Let $E$ be an elliptic curve defined over $\mathbb{Q}$. For a quadratic number field $K$ and an odd prime number $p$, let $L$ be a $\mathbb{Z}_p$-extension of $K$. We prove that $E(L)_{\text{tors}}=E(K)_{\text{tors}}$ when $p>5$. It enables…

Number Theory · Mathematics 2025-05-08 Omer Avci

We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…

Number Theory · Mathematics 2019-02-20 François Morain , Charlotte Scribot , Benjamin Smith

We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…

Number Theory · Mathematics 2007-05-23 Denis Charles

Let $P$ be a polygon with $k$ vertices. Let $R$ and $B$ be two simple, interior disjoint curves on the boundary of $P$, with $n$ and $m$ vertices. We show how to compute the Fr\'echet distance between $R$ and $B$ using the geodesic…

Computational Geometry · Computer Science 2025-04-21 Thijs van der Horst , Marc van Kreveld , Tim Ophelders , Bettina Speckmann

Given an elliptic curve $E$ in Legendre form $y^2 = x(x - 1)(x - \lambda)$ over the fraction field of a Henselian ring $R$ of mixed characteristic $(0, 2)$, we present an algorithm for determining a semistable model of $E$ over $R$ which…

Number Theory · Mathematics 2021-07-01 Jeffrey Yelton

Let $E$ and $E'$ be 2-isogenous elliptic curves over $\Q$. Following \cite{ck}, we call a good prime $p$ \emph{anomalous} if $E(\F_p) \simeq E'(\F_p)$ but $E(\F_{p^2}) \not \simeq E'(\F_{p^2})$. Our main result is an explicit formula for…

We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus $g$ defined over $\mathbb{F}_q$. It is based on the approaches by Schoof and Pila combined with a modeling of the…

Number Theory · Mathematics 2018-06-08 Simon Abelard , Pierrick Gaudry , Pierre-Jean Spaenlehauer

Let $q > 5$ be a prime and $K$ a quadratic number field. In this article we extend a previous result of Najman and the author and prove that if $E/K$ is an elliptic curve with potentially multiplicative reduction at all primes $\mathfrak q…

Number Theory · Mathematics 2023-06-21 George C. Ţurcaş

Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $K$ be a number field of degree four that is Galois over $\mathbb{Q}$. The goal of this article is to classify the different isomorphism types of $E(K)_{\text{tors}}$.

Number Theory · Mathematics 2015-11-05 Michael Chou

We consider the problem of computing the topology and describing the geometry of a parametric curve in $\mathbb{R}^n$. We present an algorithm, PTOPO, that constructs an abstract graph that is isotopic to the curve in the embedding space.…

Symbolic Computation · Computer Science 2022-02-18 Christina Katsamaki , Fabrice Rouillier , Elias Tsigaridas

We describe methods to determine all the possible torsion groups of an elliptic curve that actually appear over a fixed quadratic field. We use these methods to find, for each group that can appear over a quadratic field, the field with the…

Number Theory · Mathematics 2024-02-28 Sheldon Kamienny , Filip Najman

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…

Number Theory · Mathematics 2020-06-17 Kirsten Eisentraeger , Sean Hallgren , Chris Leonardi , Travis Morrison , Jennifer Park

Supersingular elliptic curve isogeny graphs underlie isogeny-based cryptography. For isogenies of a single prime degree $\ell$, their structure has been investigated graph-theoretically. We generalise the notion of $\ell$-isogeny graphs to…

Number Theory · Mathematics 2025-12-05 Sarah Arpin , Ross Bowden , James Clements , Wissam Ghantous , Jason T. LeGrow , Krystal Maughan

We work out the complete descent via 4-isogeny for a family of rational elliptic curves with a rational point of order 4; such a family is of the form $y^2 + x y + a y = x^3 + a x^2$ where $\sqrt{-a} \in \mathbb Q^\times$. In the process we…

Number Theory · Mathematics 2007-05-23 Edray Herber Goins

Let $n$ be an integer such that the modular curve $X_0(n)$ is hyperelliptic of genus $\ge2$ and such that the Jacobian of $X_0(n)$ has rank $0$ over $\mathbb Q$. We determine all points of $X_0(n)$ defined over quadratic fields, and we give…

Number Theory · Mathematics 2022-03-25 Peter Bruin , Filip Najman

We present an unconditional CRT algorithm to compute the modular polynomial $\Phi_\ell(X,Y)$ in quasi-linear time. The main ingredients of our algorithm are: the embedding of $\ell$-isogenies in smooth-degree isogenies in higher dimension,…

Number Theory · Mathematics 2024-08-14 Sabrina Kunzweiler , Damien Robert
‹ Prev 1 4 5 6 7 8 10 Next ›