Nonlinear congruential pseudorandom number generators can have unexpectedly short periods. Shamir and Tsaban introduced the class of counter-dependent generators which admit much longer periods. In this paper we present a discrepancy bound for sequences of s-tuples of successive pseudorandom numbers generated by counter-dependent generators and a lower bound on their linear complexity.
|Number of pages||13|
|Journal||JP Journal of Algebra, Number Theory and Applications|
|Publication status||Published - 2006|
- pseudorandom numbers
- nonlinear congruential method
- exponential sums