• DocumentCode
    1348710
  • Title

    Pseudorandom Bits From Points on Elliptic Curves

  • Author

    Farashahi, Reza Rezaeian ; Shparlinski, Igor E.

  • Author_Institution
    Dept. of Comput., Macquarie Univ., Sydney, NSW, Australia
  • Volume
    58
  • Issue
    2
  • fYear
    2012
  • Firstpage
    1242
  • Lastpage
    1247
  • Abstract
    Let E be an elliptic curve over a finite field Fq of q elements, with gcd(q,6)=1, given by an affine Weierstraß equation. We use x(P) to denote the x-component of a point P=(x(P),y(P)) ∈ E. We estimate character sums of the form Σn=1Nχ(x(nP)x(nQ)) and Σn1,⋯,nk=1Nψ(Σj=1k cjx((Πi=1j ni)R)) on average over all Fq rational points P, Q, and R on E, where χ is a quadratic character, ψ is a nontrivial additive character in Fq, and (c1,..., ck) ∈ Fqk is a nonzero vector. These bounds confirm several recent conjectures of Jao, Jetchev, and Venkatesan, related to extracting random bits from various sequences of points on the elliptic curves.
  • Keywords
    curve fitting; random number generation; character sums; elliptic curve; nontrivial additive character; nonzero vector; pseudorandom bits; Additives; Cryptography; Elliptic curves; Frequency modulation; Generators; Polynomials; Character sums; elliptic curves; pseudorandom bits;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2011.2170054
  • Filename
    6043877