Analysis and design of stream ciphers
Analysis and design of stream ciphers
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Lattice computations for random numbers
Mathematics of Computation
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Modern Computer Algebra
Improved long-period generators based on linear recurrences modulo 2
ACM Transactions on Mathematical Software (TOMS)
WSC '05 Proceedings of the 37th conference on Winter simulation
Efficient Jump Ahead for F2-Linear Random Number Generators
INFORMS Journal on Computing
| Hi-index | 0.00 |
Linear recurring sequences with very large periods are widely used as the basic building block of pseudorandom number generators. In many simulation applications, multiple streams of random numbers are needed, and these multiple streams are normally provided by jumping ahead in the sequence to obtain starting points that are far apart. For maximal-period generators having a large state space, this jumping ahead can be costly in both time and memory usage. We propose a new jump ahead method for this kind of situation. It requires much less memory than the fastest algorithms proposed earlier, while being approximately as fast (or faster) for generators with a large state space such as the Mersenne twister.