Related papers: Finding elliptic curves with a subgroup of prescri…

For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…

Let $E$ be an elliptic curve defined over $\mathbb Q$ and $\widetilde{E}_p$ denote the reduction of $E$ modulo a prime $p$ of good reduction for $E$. The divisibility of $|\widetilde{E}_{p}(\mathbb{F}_p)|$ by an integer $m\ge 2$ for a set…

Given an elliptic curve $E$ over a finite field $\F_q$ of $q$ elements, we say that an odd prime $\ell \nmid q$ is an Elkies prime for $E$ if $t_E^2 - 4q$ is a quadratic residue modulo $\ell$, where $t_E = q+1 - #E(\F_q)$ and $#E(\F_q)$ is…

Let $\epsilon>0$. In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve $C$ of genus $g$ over a finite field $k$ of cardinality $q$ given by $y^2+h(x)y=f(x)$ such that the…

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 a CM elliptic curve over $\Bbb{Q}$. We refine the work of Cojocaru on the asymptotic formulae for the number of primes $p\le x$ for which the reduction modulo $p$ of $E$ is of square-free order. Also, we derive an unconditional…

For a given elliptic curve $E/\mathbb{Q}$, let $N_p(E)$ be the number of points on $E$ modulo $p$ for a prime of good reduction for $E$. Given integer $n$, let $G_k(E,n)$ be the number of $k$-tuples of $p_1<p_2<\ldots <p_k$ primes of good…

Let $K_i$ be a number field for all $i \in \mathbb{Z}_{> 0}$ and let $\mathcal{E}$ be a family of elliptic curves containing infinitely many members defined over $K_i$ for all $i$. Fix a rational prime $p$. We give sufficient conditions for…

Given a supersingular elliptic curve E and a non-scalar endomorphism $\alpha$ of E, we prove that the endomorphism ring of E can be computed in classical time about disc(Z[$\alpha$])^1/4 , and in quantum subexponential time, assuming the…

Given a prime power q, for every pair of positive integers m and n with m dividing the GCD of n and q-1, we construct a modular curve over F_q that parametrizes elliptic curves over F_q along with F_q-defined points P and Q of order m and…

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…

For E/k an elliptic curve with CM by O, we determine a formula for (a generalization of) the arithmetic local constant of [4] at almost all primes of good reduction. We apply this formula to the CM curves defined over Q and are able to…

Consider two elliptic curves $E,E'$ defined over the finite field $\mathbb{F}_q$, and suppose that there exists an isogeny $\psi$ between $E$ and $E'$. We propose an algorithm that determines $\psi$ from the knowledge of $E$, $E'$ and of…

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…

An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same…

In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…

Let $E$ be an elliptic curve defined over rational field $\mathbb{Q}$ and $N$ be a positive integer. Now, $M_E(N)$ denotes the number of primes $p$, such that the group $E_p(\mathbb{F}_p)$ is of order $N$. We show that $M_E(N)$ follows…

We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…

Given a prime $p$, an elliptic curve $\E/\F_p$ over the finite field $\F_p$ of $p$ elements and a binary \lrs\ $\(u(n)\)_{n =1}^\infty$ of order~$r$, we study the distribution of the sequence of points $$ \sum_{j=0}^{r-1} u(n+j)P_j, \qquad…

Let E be an elliptic curve without complex multiplication (CM) over a number field K, and let G_E(ell) be the image of the Galois representation induced by the action of the absolute Galois group of K on the ell-torsion subgroup of E. We…