English
Related papers

Related papers: Computing isogenies between supersingular elliptic…

200 papers

A Howe curve is a curve of genus $4$ obtained as the fiber product over $\mathbf{P}^1$ of two elliptic curves. Any Howe curve is canonical. This paper provides an efficient algorithm to find superspecial Howe curves and that to enumerate…

Number Theory · Mathematics 2021-10-04 Momonari Kudo , Shushi Harashita

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…

Number Theory · Mathematics 2011-12-22 R. L. Miller , M. Stoll

Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$ without CM. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each elliptic curve in $\mathcal{E}$ and an edge for…

Number Theory · Mathematics 2023-02-23 Garen Chiloyan

The paper concerns several theoretical aspects of oriented supersingular $\ell$-isogeny volcanoes and their relationship to closed walks in the supersingular $\ell$-isogeny graph. Our main result is a bijection between the rims of the union…

In this paper, we study the problem of sampling random supersingular elliptic curves with unknown endomorphism rings. This problem has recently gained considerable attention as many isogeny-based cryptographic protocols require such…

Quantum Physics · Physics 2026-03-24 Maher Mamah , Jake Doliskani , David Jao

In this paper the family of elliptic curves over \Q given by the equation E_{p}: Y^2=(X-p)^3+X^3+(X+p)^3 where p is a prime number, is studied. It is shown that the maximal rank of the elliptic curves is at most 3 and some conditions under…

Number Theory · Mathematics 2012-01-30 A. Astaneh-Asl

Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…

Number Theory · Mathematics 2019-02-20 Chantal David , Ethan Smith

In this paper we consider the isoptic curves on the 2-dimensional geometries of constant curvature $\bE^2,~\bH^2,~\cE^2$. The topic is widely investigated in the Euclidean plane $\bE^2$ see for example \cite{CMM91} and \cite{Wi} and the…

Geometric Topology · Mathematics 2013-01-31 Géza Csima , Jenő Szirmai

Let $E$ be an elliptic curve over a number field $k$ of degree $d$ that admits a $k$-rational isogeny of prime degree $p$. We study the question of finding a uniform bound on $p$ that depends only on $d$, and obtain, under a certain…

Number Theory · Mathematics 2023-06-22 Barinder S. Banwait , Maarten Derickx

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…

Number Theory · Mathematics 2017-09-06 Ane Anema

Let $E_{1}$ and $E_{2}$ be elliptic curves defined over a number field $K$. We say that $E_{1}$ and $E_{2}$ are discriminant ideal twins if they are not $K$-isomorphic and have the same minimal discriminant ideal and conductor. Such curves…

Number Theory · Mathematics 2026-04-14 Alexander J. Barrios , Maila Brucal-Hallare , Alyson Deines , Piper Harris , Manami Roy

In algebraic geometry, superspecial curves are important research objects. While the number of superspecial genus-3 curves in characteristic $p$ is known, the number of hyperelliptic ones among them has not been determined even for small…

Algebraic Geometry · Mathematics 2025-07-17 Ryo Ohashi , Hiroshi Onuki , Momonari Kudo , Ryo Yoshizumi , Koji Nuida

We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…

Computational Geometry · Computer Science 2024-07-26 Michael Burr , Michael Byrd

We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…

Computational Geometry · Computer Science 2024-07-29 Michael Burr , Michael Byrd

We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.

Number Theory · Mathematics 2010-05-31 Irene Garcia-Selfa , Jose M. Tornero

We put together some known theoretical results and the fact that certain computations can be done efficiently in SAGE to come up with a fast algorithm for calculating congruence primes linking a newform with integer coefficients (i.e. a…

Number Theory · Mathematics 2012-02-24 Randy Heaton

In this paper, $p$ and $q$ are two different odd primes. First, We construct the congruent elliptic curves corresponding to $p$, $2p$, $pq$, and $2pq,$ then, in the cases of congruent numbers, we determine the rank of the corresponding…

Number Theory · Mathematics 2017-01-11 Farzali Izadi , Hamid Reza Abdolmaleki

Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…

Algebraic Geometry · Mathematics 2022-03-03 Elie Eid

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…

Computational Geometry · Computer Science 2017-09-19 Siamak Yousefi , Xiao-Wen Chang , Henk Wymeersch , Benoit Champagne , Godfried Toussaint

The supersingular Endomorphism Ring problem is the following: given a supersingular elliptic curve, compute all of its endomorphisms. The presumed hardness of this problem is foundational for isogeny-based cryptography. The One Endomorphism…

Cryptography and Security · Computer Science 2023-10-17 Aurel Page , Benjamin Wesolowski
‹ Prev 1 4 5 6 7 8 10 Next ›