Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR99-021 | 8th April 1999 00:00

ON THE UNIFORMITY OF DISTRIBUTION OF A CERTAIN PSEUDO-RANDOM FUNCTION

RSS-Feed




TR99-021
Authors: Igor E. Shparlinski
Publication: 14th June 1999 23:20
Downloads: 1150
Keywords: 


Abstract:

We show that a pseudo-random number generator,
introduced recently by M. Naor and O. Reingold,
possess one more attractive and useful property.
Namely, it is proved that for almost all values of parameters it
produces a uniformly distributed sequence.
The proof is based on some recent bounds of exponential
sums with exponential functions.



ISSN 1433-8092 | Imprint