arXiv Analytics

Sign in

arXiv:1005.4771 [math.NT]AbstractReferencesReviewsResources

Pseudorandom Bits From Points on Elliptic Curves

Reza R. Farashahi, Igor E. Shparlinski

Published 2010-05-26Version 1

Let $\E$ be an elliptic curve over a finite field $\F_{q}$ of $q$ elements, with $\gcd(q,6)=1$, given by an affine Weierstra\ss\ equation. We also use $x(P)$ to denote the $x$-component of a point $P = (x(P),y(P))\in \E$. We estimate character sums of the form $$ \sum_{n=1}^N \chi\(x(nP)x(nQ)\) \quad \text{and}\quad \sum_{n_1, \ldots, n_k=1}^N \psi\(\sum_{j=1}^k c_j x\(\(\prod_{i =1}^j n_i\) R\)\) $$ on average over all $\F_q$ rational points $P$, $Q$ and $R$ on $\E$, where $\chi$ is a quadratic character, $\psi$ is a nontrivial additive character in $\F_q$ and $(c_1, \ldots, c_k)\in \F_q^k$ is a non-zero vector. These bounds confirm several recent conjectures of D. Jao, D. Jetchev and R. Venkatesan, related to extracting random bits from various sequences of points on elliptic curves.

Related articles: Most relevant | Search more
arXiv:1306.1410 [math.NT] (Published 2013-06-06)
Computing the Cassels-Tate pairing on the 3-Selmer group of an elliptic curve
arXiv:math/0406244 [math.NT] (Published 2004-06-11)
Mod p representations on elliptic curves
arXiv:math/0401289 [math.NT] (Published 2004-01-22)
Trace of Frobenius endomorphism of an elliptic curve with complex multiplication