Related papers: On the Correspondence between Supersingular Ellipt…

We apply classical invariant theory of binary forms to explicitly characterize isomorphism classes of hyperelliptic curves of small genus and, conversely, propose algorithms for reconstructing hyperelliptic models from given invariants. We…

Fix an elliptic curve $E$ over $\mathbb Q$ of rank $1$. In this paper, we develop an explicit numerical criterion, comparable to Gold's criterion, that determines whether the Iwasawa invariants of the elliptic curve at a good (ordinary or…

A weaker form of a 1979 conjecture of Goldfeld states that for every elliptic curve $E/\mathbb{Q}$, a positive proportion of its quadratic twists $E^{(d)}$ have rank 1. Using tools from Galois cohomology, we give criteria on E and d which…

For the integer $ D=pq$ of the product of two distinct odd primes, we construct an elliptic curve $E_{2rD}:y^2=x^3-2rDx$ over $\mathbb Q$, where $r$ is a parameter dependent on the classes of $p$ and $q$ modulo 8, and show, under the parity…

We consider algebraic affine and projective curves of Edwards \cite{E, SkOdProj} over a finite field $\text{F}_{p^n}$. Most cryptosystems of the modern cryptography \cite{SkBlock} can be naturally transform into elliptic curves \cite{Kob}.…

Contents: Rational functions with given monodromy on generic curves (I. Bouw & S. Wewers); Can deformation rings of group representations not be local complete intersections? (T. Chinburg); Lifting an automorphism group to finite…

We present families of (hyper)elliptic curve which admit an efficient deterministic encoding function.

Let F and K be number fields, with F contained in K. and let O_F and O_K be their rings of integers. If there exists an elliptic curve E over F such that E(F) and E(K) have rank 1, then there exists a diophantine definition of O_F over O_K.

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

We give practical numerical methods to compute the period matrix of a plane algebraic curve (not necessarily smooth). We show how automorphisms and isomorphisms of such curves, as well as the decomposition of their Jacobians up to isogeny,…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

We give an infinite family of congruent number elliptic curves, each with rank at least two, which are related to integral solutions of $m^2=n^2+nl+l^2$.

We develop a graph-theoretic algorithm to compute the $\varphi$-Selmer group of the elliptic curve $E_b: y^2 = x^3 + bx$ over $\mathbb{Q}(i)$, where $b \in \mathbb{Z}[i]$ and $\varphi$ is a degree 2 isogeny of $E_b$. We associate to $E_b$ a…

This article considers the family of elliptic curves given by $E_{p}: y^2=x^3-5px$ and certain conditions on an odd prime $p$. More specifically, we have shown that if $p \equiv 7, 23 \pmod {40}$, then the rank of $E_{p}$ is zero for both $…

For each prime number $\ell$ and for each imaginary quadratic order of class number one or two, we determine all the possible $\ell$-adic Galois representations that occur for any elliptic curve with complex multiplication by such an order…

Let $\mathbb{F}_q[T]$ be the polynomial ring over a finite field $\mathbb{F}_q$. We study the endomorphism rings of Drinfeld $\mathbb{F}_q[T]$-modules of arbitrary rank over finite fields. We compare the endomorphism rings to their subrings…

For an elliptic curve $E/\Q$, we determine the maximum number of twists $E^d/\Q$ it can have such that $E^d(\Q)_{tors}\supsetneq E(\Q)[2]$. We use these results to determine the number of distinct quadratic fields $K$ such that…

For a given elliptic curve $E$ defined over the rationals, we study the density of primes $p$ satisfying $\mathrm{gcd}(\#E(\mathbb{F}_p),p-1)=1$ and give a conjectural value for this density with strong heuristic evidence for most elliptic…

We construct new families of elliptic curves over \(\FF_{p^2}\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant-Lambert-Vanstone (GLV) and…

We prove that the path-finding problem in $\ell$-isogeny graphs and the endomorphism ring problem for supersingular elliptic curves are equivalent under reductions of polynomial expected time, assuming the generalised Riemann hypothesis.…