English

Pseudorandom Bits From Points on Elliptic Curves

Number Theory 2010-05-27 v1 Cryptography and Security

Abstract

Let \E\E be an elliptic curve over a finite field \Fq\F_{q} of qq elements, with gcd(q,6)=1\gcd(q,6)=1, given by an affine Weierstra\ss\ equation. We also use x(P)x(P) to denote the xx-component of a point P=(x(P),y(P))\EP = (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 \Fq\F_q rational points PP, QQ and RR on \E\E, where χ\chi is a quadratic character, ψ\psi is a nontrivial additive character in \Fq\F_q and (c1,,ck)\Fqk(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.

Keywords

Cite

@article{arxiv.1005.4771,
  title  = {Pseudorandom Bits From Points on Elliptic Curves},
  author = {Reza R. Farashahi and Igor E. Shparlinski},
  journal= {arXiv preprint arXiv:1005.4771},
  year   = {2010}
}
R2 v1 2026-06-21T15:27:57.339Z