Related papers: Pseudorandom Bits From Points on Elliptic Curves

By considering a one-parameter family of elliptic curves defined over $\mathbb{Q}$, we might ask ourselves if there is any bias in the distribution (or parity) of the root numbers at each specialization. From the work of Helfgott, we know…

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…

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

In this article we use techniques from coding theory to derive upper bounds for the number of rational places of the function field of an algebraic curve defined over a finite field. The used techniques yield upper bounds if the…

We prove two related concentration inequalities concerning the number of rational points of hyperelliptic curves over subsets of a finite field. In particular, we investigate the probability of a large discrepancy between the numbers of…

We determine the probability that a random Weierstrass equation with coefficients in the $p$-adic integers defines an elliptic curve with a non-trivial $3$-torsion point, or with a degree $3$ isogeny, defined over the field of $p$-adic…

Let $\F_q$ ($q=p^r$) be a finite field. In this paper the number of irreducible polynomials of degree $m$ in $\F_q[x]$ with prescribed trace and norm coefficients is calculated in certain special cases and a general bound for that number is…

Using Semaev's summation polynomials, we derive a new equation for the $\mathbb{F}_q$-rational points of the trace zero variety of an elliptic curve defined over $\mathbb{F}_q$. Using this equation, we produce an optimal-size representation…

In this paper we show that the map % $$\partial:CH^2(E_1 \times E_2,1)\otimes \Q \longrightarrow PCH^1(\XX_v)$$ % is surjective, where $E_1$ and $E_2$ are two non-isogenous semistable elliptic curves over a local field, $CH^2(E_1 \times…

Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…

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 study the interaction between the group law on an elliptic curve and the additive structure of $x$-coordinates of rational points on an elliptic curve. Let $E/\mathbb{Q}$ be an elliptic curve of Mordell-Weil rank $r \geq 1$, $d \geq 1$…

The number A(q) shows the asymptotic behaviour of the quotient of the number of rational points over the genus of non-singular absolutely irreducible curves over a finite field Fq. Research on bounds for A(q) is closely connected with the…

Let $q\geqslant2$ be an integer, $\chi$ be any non-principal character mod $q$, and $H=H(q)\leqslant q.$ In this paper the authors prove some estimates for character sums of the form…

Let $p$ be an odd prime. Using I. M. Vinogradov's bilinear estimate, we present an elementary approach to estimate nontrivially the character sum $$ \sum_{x\in H}\chi(x+a),\qquad a\in\Bbb F_p^*, $$ where $H<\Bbb F_p^*$ is a multiplicative…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

Let E be a non-CM elliptic curve defined over Q. For each prime p of good reduction, E reduces to a curve E_p over the finite field F_p. For a given squarefree polynomial f(x,y), we examine the sequences f_p(E) := f(a_p(E), p), whose values…

For a given elliptic curve $\mathbf{E}$ over a finite field of odd characteristic and a rational function $f$ on $\mathbf{E}$ we first study the linear complexity profiles of the sequences $f(nG)$, $n=1,2,\dots$ which complements earlier…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…