Related papers: Dual Elliptic Primes and Applications to Cyclotomy…
In a former paper it has been shown that the elliptic Gau{\ss} sums, whose use has been proposed in the context of counting points on elliptic curves and primality tests, can be computed by using modular functions. In this work we give…
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…
Let $[K:\mathbb{Q}]=p$ be a prime number and let $E/K$ be an elliptic curve with $j(E) \in \mathbb{Q}$. We determine the all possibilities for $E(K)_{tors}$. We obtain these results by studying Galois representations of $E$ and of it's…
We study stable curves of arithmetic genus 2 which admit two morphisms of finite degree $p$, resp. $d$, onto smooth elliptic curves, with particular attention to the case $p$ prime.
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…
Let $E$ be an elliptic curve over $\F_p$ without complex multiplication, and for each prime $p$ of good reduction, let $n_E(p) = | E(\F_p) |$. Let $Q_{E,b}(x)$ be the number of primes $p \leq x$ such that $b^{n_E(p)} \equiv b\,({\rm…
For certain elliptic curves $E/\mathbb{Q}$ with $E(\mathbb{Q})[2]=\mathbb{Z}/2 \mathbb{Z}$, we prove a criterion for prime twists of $E$ to have analytic rank 0 or 1, based on a mod 4 congruence of 2-adic logarithms of Heegner points. As an…
We define the ring of elliptic periods modulo an integer $n$ and give an elliptic version of the AKS primality criterion.
Let $K$ be a number field. For which primes $p$ does there exist an elliptic curve $E / K$ admitting a $K$-rational $p$-isogeny? Although we have an answer to this question over the rationals, extending this to other number fields is a…
We consider the structure of rational points on elliptic curves in Weierstrass form. Let x(P)=A_P/B_P^2 denote the $x$-coordinate of the rational point P then we consider when B_P can be a prime power. Using Faltings' Theorem we show that…
Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…
Let $K=\mathbb{Q}(\sqrt{-p})$ be a quadratic field for an odd prime $p$. We show that there exist infinitely many primes $p$ for which no elliptic curve $E/\mathbb{Q}$ has torsion subgroup $\mathbb{Z}/2\mathbb{Z}\times…
Let $\{E_{(p,q)}\}$ be a family of elliptic curves over a rational field such that we have $E_{(p,q)} : y^2 = x^3 - p^2x + q^2$, where $p$ and $q$ are prime numbers greater than five. Earlier work showed that the elliptic curve $E_{(p,q)}$…
We present new ideas for computing elliptic Gau{\ss} sums, which constitute an analogue of the classical cyclotomic Gau{\ss} sums and whose use has been proposed in the context of counting points on elliptic curves and primality tests. By…
Let $E$ be an elliptic curve of rank $\text{rk}(E) \geq 1$, and let $P \in E(\mathbb{Q})$ be a point of infinite order. The number of elliptic primes $p \leq x$ for which $\langle P\rangle=E(\mathbb{F}_p)$ is expected to be…
We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…
Let $C$ be a smooth genus one curve described by a quartic polynomial equation over the rational field $\mathbb Q$ with $P\in C(\mathbb Q)$. We give an explicit criterion for the divisibility-by-$2$ of a rational point on the elliptic curve…
An amicable pair for an elliptic curve E/Q is a pair of primes (p,q) of good reduction for E satisfying #E(F_p) = q and #E(F_q) = p. In this paper we study elliptic amicable pairs and analogously defined longer elliptic aliquot cycles. We…
In this paper, a random primality proving algorithm is proposed, which generates prime certificate of length O(log n). The certificate can be verified in deterministic time O(log^4 n). The algorithm runs in heuristical time tilde{O}(log^4…
Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then…