Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
A new inversive congruential pseudorandom number generator with power of two modulus
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Exponential sums over Galois rings and their applications
FFA '95 Proceedings of the third international conference on Finite fields and applications
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
On the distribution of inversive congruential pseudorandom numbers in parts of the period
Mathematics of Computation
IEEE Transactions on Information Theory
The Period Lengths of Inversive Pseudorandom Vector Generations
Finite Fields and Their Applications
On the Average Distribution of Inversive Pseudorandom Numbers
Finite Fields and Their Applications
| Hi-index | 0.00 |
We provide a new construction of nonlinear pseudorandom number generators. We use the inversive method over Galois rings. This generalizes to the common setting of Galois rings both the works of Niederreiter et al. over finite fields and Eichenauer-Herrmann et al. over integers modulo a prime power. The main proof technique to bound the discrepancy from above is the local Weil bound on hybrid character sums over Galois rings. The estimates hold for the full period and also for certain parts of the period. Elementary p-adic analysis allows us to ensure maximal period length.