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.