Pseudorandom Bits From Points on Elliptic Curves
Number Theory
2010-05-27 v1 Cryptography and Security
Abstract
Let be an elliptic curve over a finite field of elements, with , given by an affine Weierstra\ss\ equation. We also use to denote the -component of a point . 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 rational points , and on , where is a quadratic character, is a nontrivial additive character in and 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.
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}
}