Pseudorandom Bits From Points on Elliptic Curves

Abstract

Let be an elliptic curve over a finite field q of q elements, with (q,6)=1, given by an affine Weierstra\ equation. We also use x(P) to denote the x-component of a point P = (x(P),y(P))∈ . We estimate character sums of the form Σn=1N \(x(nP)x(nQ)\) and Σn1, …, nk=1N \(Σj=1k cj x\(\(Πi =1j ni\) R\)\) on average over all q rational points P, Q and R on , where is a quadratic character, is a nontrivial additive character in q and (c1, …, ck)∈ qk 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…