English
Related papers

Related papers: Predicting the elliptic curve congruential generat…

200 papers

We characterize the possible groups $E(\mathbb{Z}/N\mathbb{Z})$ arising from elliptic curves over $\mathbb{Z}/N\mathbb{Z}$ in terms of the groups $E(\mathbb{F}_p)$, with $p$ varying among the prime divisors of $N$. This classification is…

Number Theory · Mathematics 2024-03-11 Massimiliano Sala , Daniele Taufer

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)}$…

Number Theory · Mathematics 2022-07-08 M. Khazali , H. Daghigh , A. Alidadi

We present an algorithm that, on input of a positive integer N together with its prime factorization, constructs a finite field F and an elliptic curve E over F for which E(F) has order N. Although it is unproved that this can be done for…

Number Theory · Mathematics 2007-05-23 Reinier Broker , Peter Stevenhagen

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…

Number Theory · Mathematics 2017-01-03 Igor E. Shparlinski , Andrew V. Sutherland

For an elliptic curve $E$ over a finite field we define the point sequence $(P_n)$ recursively by $P_n=\vartheta (P_{n-1})=\vartheta ^n(P_0)$ with an endomorphism $\vartheta \in\mathrm{End}(E)$ and with some initial point $P_0$ on $E$. We…

Number Theory · Mathematics 2017-06-28 László Mérai

The Fermat numbers have many notable properties, including order universality, coprimality, and definition by a recurrence relation. We use arbitrary elliptic curves and rational points of infinite order to generate sequences that are…

Number Theory · Mathematics 2019-02-06 Skye Binegar , Randy Dominick , Meagan Kenney , Jeremy Rouse , Alex Walsh

Let $E$ be an elliptic curve defined over a field $K$ (with $char(K)\neq 2$) given by a Weierstrass equation and let $P=(x,y)\in E(K)$ be a point. Then for each $n$ $\geq 1$ and some $\gamma \in K^{\ast }$ we can write the $x$- and…

Number Theory · Mathematics 2019-09-30 Betül Gezer

Let $E$ be an elliptic curve over $\mathbb{Q}$ described by $y^2= x^3+ Kx+ L$ where $K, L \in \mathbb{Q}$. A set of rational points $(x_i,y_i) \in E(\mathbb{Q})$ for $i=1, 2, \cdots, k$, is said to be a sequence of consecutive cubes on $E$…

Number Theory · Mathematics 2018-06-05 Gamze Savaş Çelik , Gökhan Soydan

We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…

Number Theory · Mathematics 2021-03-30 Reinier Broker , Peter Stevenhagen

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…

Number Theory · Mathematics 2011-02-08 Simon R. Blackburn , Alina Ostafe , Igor E. Shparlinski

In this paper, $p$ and $q$ are two different odd primes. First, We construct the congruent elliptic curves corresponding to $p$, $2p$, $pq$, and $2pq,$ then, in the cases of congruent numbers, we determine the rank of the corresponding…

Number Theory · Mathematics 2017-01-11 Farzali Izadi , Hamid Reza Abdolmaleki

We will describe an algorithm to construct an elliptic curve $E_{f_q}$ over some prime field $\mathbb{F}_p$ such that such that $|E_{f_q}(\mathbb{F}_p)| = f_q$, where $f_q$ is a probable Fibonacci prime for some prime index $q$. The…

Number Theory · Mathematics 2017-10-17 Rosina Campbell , Duc Van Huynh , Tyler Melton , Andrew Percival

Let $C$ be an elliptic curve defined over $\mathbb Q$ by the equation $y^2=x^3+Ax+B$ where $A,B\in\mathbb Q$. A sequence of rational points $(x_i,y_i)\in C(\mathbb Q),\,i=1,2,\ldots,$ is said to form a sequence of consecutive squares on $C$…

Number Theory · Mathematics 2017-08-15 Mohamed Kamel , Mohammad Sadek

Given an elliptic curve $E$ and a finite Abelian group $G$, we consider the problem of counting the number of primes $p$ for which the group of points modulo $p$ is isomorphic to $G$. Under a certain conjecture concerning the distribution…

Number Theory · Mathematics 2014-02-13 Chantal David , Ethan Smith

An elliptic divisibility sequence is an integer recurrence sequence associated to an elliptic curve over the rationals together with a rational point on that curve. In this paper we present a higher-dimensional analogue over arbitrary base…

Number Theory · Mathematics 2014-12-30 Katherine E. Stange

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

Number Theory · Mathematics 2008-12-16 Chantal David , Jie Wu

Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…

Number Theory · Mathematics 2019-02-20 Chantal David , Ethan Smith

For a pair $(E,P)$ of an elliptic curve $E/\mathbb{Q}$ and a nontorsion point $P\in E(\mathbb{Q})$, the sequence of \emph{elliptic Fermat numbers} is defined by taking quotients of terms in the corresponding elliptic divisibility sequence…

Number Theory · Mathematics 2018-08-14 Seoyoung Kim , Alexandra Walsh

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…

Number Theory · Mathematics 2023-01-23 Nuno Arala

Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…

Number Theory · Mathematics 2012-07-31 E. A. Grechnikov
‹ Prev 1 2 3 10 Next ›