Related papers: Predicting the elliptic curve congruential generat…
When p is congruent to 1 mod 8, we have a criterion of the quadratic character of 1+\sqrt{2}, which is related to the class number of \Q(\sqrt{-p}). In this paper, we obtain a similar criterion using an elliptic curve, which contrasts to…
Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…
Let $E$ be an elliptic curve defined over $\mathbb{Q}$. For a quadratic number field $K$ and an odd prime number $p$, let $L$ be a $\mathbb{Z}_p$-extension of $K$. We prove that $E(L)_{\text{tors}}=E(K)_{\text{tors}}$ when $p>5$. It enables…
We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.
Let $E$ be an elliptic curve defined over the rationals and in minimal Weierstrass form, and let $P=(x_1/z_1^2,y_1/z_1^3)$ be a rational point of infinite order on $E$, where $x_1,y_1,z_1$ are coprime integers. We show that the integer…
Given an elliptic curve C, we study here $N_k = #C(F_{q^k})$, the number of points of C over the finite field F_{q^k}. This sequence of numbers, as k runs over positive integers, has numerous remarkable properties of a combinatorial flavor…
Let $p$ be a prime number, $F$ a field of characteristic $p$, and $G$ a cyclic group of order $q =p^a$ for some positive integer $a$. Under these circumstances every indecomposable $F G$-module is cyclic. For indecomposable $F G$-modules…
In this paper, we construct a family of elliptic curves with rank $\geq 5$. To do this, we use the Heron formula for a triple $(A^2, B^2, C^2)$ which are not necessarily the three sides of a triangle. It turns out that as parameters of a…
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…
Given an elliptic curve E over a finite field F_q of q elements, we say that an odd prime ell not dividing q is an Elkies prime for E if t_E^2 - 4q is a square modulo ell, where t_E = q+1 - #E(F_q) and #E(F_q) is the number of F_q-rational…
Let $E$ be the elliptic curve $y^2=x(x+1)(x+t)$ over the field $\Fp(t)$ where $p$ is an odd prime. We study the arithmetic of $E$ over extensions $\Fq(t^{1/d})$ where $q$ is a power of $p$ and $d$ is an integer prime to $p$. The rank of $E$…
Let $p$ be a prime number and $E_{p}$ denote the elliptic curve $y^2=x^3+px$. It is known that for $p$ which is congruent to $1, 9$ modulo $16$, the rank of $E_{p}$ over $\mathbb{Q}$ is equal to $0, 2$. Under the condition that the Birch…
Let $E$ be an elliptic curve defined over ${\mathbb Q}$. For a prime $p$ of good reduction for $E$, denote by $e_p$ the exponent of the reduction of $E$ modulo $p$. Under GRH, we prove that there is a constant $C_E\in (0, 1)$ such that $$…
Let $E:y^2=x^3+ax+b$ be an elliptic curve defined over $\mathbb{Q}$. We compute certain twists of the classical modular curves $X(8)$. Searching for rational points on these twists enables us to find non-trivial pairs of $8$-congruent…
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…
We consider a particular case of an analog for elliptic curves to the Mersenne problem : finding explicitely all prime power terms in an elliptic divisibility sequence when descent via isogeny is possible. We explain how this question can…
We formulate a problem called \emph{Generalized Root Extraction} in finite Abelian groups that have more than one generator. We then study this problem for the specific case of the torsion subgroups of elliptic curves. We give a necessary…
Let $E_n$ be the congruent number elliptic curve $y^2=x^3-n^2x$, where $n$ is square-free and not divisible by primes $p\equiv 3\pmod 4$. In this paper, we prove that $L(E_n,1)$ can be expressed as the square of CM values of some simple…
The ancient unsolved problem of congruent numbers has been reduced to one of the major questions of contemporary arithmetic: the finiteness of the number of curves over $\bf Q$ which become isomorphic at every place to a given curve. We…