On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves

نویسندگان

  • Simon R. Blackburn
  • Alina Ostafe
  • Igor E. Shparlinski
چکیده

Given a prime p, an elliptic curve E/Fp over the finite field Fp of p elements and a binary linear recurrence sequence (u(n))∞n=1 of order r, we study the distribution of the sequence of points r−1 ∑ j=0 u(n+ j)Pj , n = 1, . . . , N, on average over all possible choices of Fp-rational points P1, . . . , Pr on E . For a sufficiently large N we improve and generalise a previous result in this direction due to E. El Mahassni.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Distribution of the Elliptic Subset Sum Generator of Pseudorandom Numbers

We show that for almost all choices of parameters, the elliptic subset sum pseudorandom number generator produces a sequence of uniformly distributed pseudorandom numbers. The result is useful for both cryptographic and Quasi Monte Carlo applications and relies on bounds of exponential sums.

متن کامل

On the multidimensional distribution of the subset sum generator of pseudorandom numbers

We show that for a random choice of the parameters, the subset sum pseudorandom number generator produces a sequence of uniformly and independently distributed pseudorandom numbers. The result can be useful for both cryptographic and quasi-Monte Carlo applications and relies on bounds of exponential sums.

متن کامل

Pseudorandom sequences from elliptic curves

In this article we will generalize some known constructions to produce pseudorandom sequences with the aid of elliptic curves. We will make use of both additive and multiplicative characters on elliptic curves.

متن کامل

Construction of large families of pseudorandom subsets using elliptic curves

Recently, Dartyge and Sárközy investigated the measures, i.e., the well distribution measure and the correlation measure of order k, of pseudorandomness of subsets of the set {1, 2, . . . ,N}, and they presented several constructive examples for subsets with strong pseudorandom properties when N is a prime number. In this article, we present a construction of pseudorandom subsets using elliptic...

متن کامل

Remarks on Pseudorandom Binary Sequences Over Elliptic Curves

In the paper the pseudorandomness of binary sequences defined over elliptic curves is studied and both the well-distribution and correlation measures are estimated. The paper is based on the KohelShparlinski bound and the Erdős-Turán-Koksma inequality. 2000 Mathematics Subject Classification: Primary 11K45

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2011  شماره 

صفحات  -

تاریخ انتشار 2011