Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 411-423 |
| Number of pages | 13 |
| Journal | JP Journal of Algebra, Number Theory and Applications |
| Volume | 6 |
| Issue number | 2 |
| Publication status | Published - 2006 |
Keywords
- pseudorandom numbers
- nonlinear congruential method
- discrepancy
- exponential sums