Related papers: On Division Polynomial PIT and Supersingularity

For $q$ a prime power, the discrete logarithm problem (DLP) in $\mathbb{F}_{q}$ consists in finding, for any $g \in \mathbb{F}_{q}^{\times}$ and $h \in \langle g \rangle$, an integer $x$ such that $g^x = h$. We present an algorithm for…

Let E/Q be an elliptic curve, let L(E,s)=\sum a_n/n^s be the L-series of E/Q, and let P be a point in E(Q). An integer n > 2 having at least two distinct prime factors will be be called an elliptic pseudoprime for (E,P) if E has good…

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…

We show that if $E/\mathbb{Q}$ is an elliptic curve without complex multiplication and for which there is a prime $q$ such that the image of $\bar{\rho}_{E,q}$ is contained in the normaliser of a split Cartan subgroup of…

Shor's quantum algorithm for discrete logarithms applied to elliptic curve groups forms the basis of a "quantum attack" of elliptic curve cryptosystems. To implement this algorithm on a quantum computer requires the efficient implementation…

For various positive integers $n$, we show the existence of infinite families of elliptic curves over $\mathbb{Q}$ with $n$-division fields, $\mathbb{Q}(E[n])$, that are not monogenic, i.e., the ring of integers does not admit a power…

The SEA algorithm for computing the cardinality of elliptic curves over finite fields in many characteristic uses modular polynomials. These polynomials come into different flavors, and methods to compute them flourished. Once equipped with…

Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…

In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly…

In insurance mathematics optimal control problems over an infinite time horizon arise when computing risk measures. Their solutions correspond to solutions of deterministic semilinear (degenerate) elliptic partial differential equations. In…

We study origami $f: C \rightarrow E$ with $G$-Galois cover $Q_8$. For a point $P \in E(\mathbb{Q}) \backslash \left\{ \mathcal{O} \right\}$, we study the field obtained by adjoining to $\mathbb{Q}$ the coordinates of all of the preimages…

In this paper we study arithmetic computations in the nonassociative, and noncommutative free polynomial ring $\mathbb{F}\{x_1,x_2,\ldots,x_n\}$. Prior to this work, nonassociative arithmetic computation was considered by Hrubes, Wigderson,…

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.…

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…

Let $E$ be an elliptic curve, with identity $O$, and let $C$ be a cyclic subgroup of odd order $N$, over an algebraically closed field $k$ with $\operatorname{char} k \nmid N$. For $P \in C$, let $s_P$ be a rational function with divisor $N…

We give a new approach to the elliptic curve discrete logarithm problem over cubic extension fields $\mathbb{F}_{q^3}$. It is based on a transfer: First an $\mathbb{F}_q$-rational $(\ell,\ell,\ell)$-isogeny from the Weil restriction of the…

For a prime $p{\,>\,}3$ and a supersingular elliptic curve $E$ defined over $\mathbb{F}_{p^2}$ with ${j(E)\notin\{0,1728\}}$, consider an endomorphism $\alpha$ of $E$ represented as a composition of $L$ isogenies of degree at most $d$. We…

We give a deterministic polynomial time algorithm to compute the endomorphism ring of a supersingular elliptic curve in characteristic p, provided that we are given two noncommuting endomorphisms and the factorization of the discriminant of…

Let E/k(T) be an elliptic curve defined over a rational function field of characteristic zero. Fix a Weierstrass equation for E. For points R in E(k(T)), write x_R=A_R/D_R^2 with relatively prime polynomials A_R(T) and D_R(T) in k[T]. The…