Related papers: Identifying supersingular elliptic curves

Given a dynamic graph subject to insertions and deletions of edges, a natural question is whether the graph presently admits a planar embedding. We give a deterministic fully-dynamic algorithm for general graphs, running in amortized…

In this paper, we show that the maximal divisible subgroup of groups $K_1$ and $K_2$ of an elliptic curve $E$ over a function field is uniquely divisible. Further those $K$-groups modulo this uniquely divisible subgroup are explicitly…

In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DLP) into a system of equations. These…

Igusa proved in 1958 that the polynomial determining the supersingularity of elliptic curve in Legendre form is separable. In this paper, we get an analogous result for curves of genus $2$ in Rosenhain form. More precisely we show that the…

It is argued that a nonsingular elliptic curve admits a natural or fundamental abelian heap structure uniquely determined by the curve itself. It is shown that the set of complex analytic or rational functions from a nonsingular elliptic…

We study hyperelliptic curves y^2=f(x) over local fields of odd residue characteristic. We introduce the notion of a "cluster picture" associated to the curve, that describes the p-adic distances between the roots of f(x), and show that…

Let $\ell$ be an odd prime, and suppose $E$ is an elliptic curve defined over the rational numbers $\mathbb{Q}$. If $E$ has an $\ell$-torsion point, then there has been significant work done on characterizing the $\ell$-divisibility of the…

We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…

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…

We investigate four properties related to an elliptic curve $E_t$ in Legendre form with parameter $t$: the curve $E_{t}$ has complex multiplication, $E_{-t}$ has complex multiplication, a point on $E_t$ with abscissa $2$ is of finite order,…

An abelian variety defined over an algebraically closed field k of positive characteristic is supersingular if it is isogenous to a product of supersingular elliptic curves and is superspecial if it is isomorphic to a product of…

In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) $y^{\prime}=p(y)$ over \emph{unbounded time domains}, where $p$ is a vector of polynomials. Contrarily to the bounded (compact) time…

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…

An important open problem in supersingular isogeny-based cryptography is to produce, without a trusted authority, concrete examples of "hard supersingular curves" that is, equations for supersingular curves for which computing the…

We give a method to construct explicitly a supersingular curve of given genus g in characteristic 2.

In this work we are interested in the characterization of curves that belong to a given surface. To the best of our knowledge, there is no known general solution to this problem. Indeed, a solution is only available for a few examples:…

In this paper we classify the complex elliptic curves $E$ for which there exist cyclic subgroups $C\leq (E,+)$ of order $n$ such that the elliptic curves $E$ and $E/C$ are isomorphic, where $n$ is a positive integer. Important examples are…

Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isogeny is believed to be computationally difficult. The fastest…

In the area of beyond-planar graphs, i.e. graphs that can be drawn with some local restrictions on the edge crossings, the recognition problem is prominent next to the density question for the different graph classes. For 1-planar graphs,…

In algebraic geometry, enumerating or finding superspecial curves in positive characteristic $p$ is important both in theory and in computation. In this paper, we propose feasible algorithms to enumerate or find superspecial hyperelliptic…