Communications of the ACM - Special issue on simulation
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Journal of the ACM (JACM)
An Asymptotically Random Tausworthe Sequence
Journal of the ACM (JACM)
The k-distribution of generalized feedback shift register pseudorandom numbers
Communications of the ACM
Shift Register Sequences
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Some linear and nonlinear methods for pseudorandom number generation
WSC '95 Proceedings of the 27th conference on Winter simulation
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
Don't trust parallel Monte Carlo!
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Getting rid of correlations among pseudorandom numbers: discarding versus tempering
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Algorithm 806: SPRNG: a scalable library for pseudorandom number generation
ACM Transactions on Mathematical Software (TOMS)
Random number generation with primitive pentanomials
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Combined random number generator via the generalized Chinese remainder theorem
Journal of Computational and Applied Mathematics
On the xorshift random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Fast random number generators based on linear recurrences modulo 2: overview and comparison
WSC '05 Proceedings of the 37th conference on Winter simulation
TestU01: A C library for empirical testing of random number generators
ACM Transactions on Mathematical Software (TOMS)
Maximally equidistributed pseudorandom number generators via linear output transformations
Mathematics and Computers in Simulation
Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
A meta-level true random number generator
International Journal of Critical Computer-Based Systems
Stochastic path tracing on consumer graphics cards
Proceedings of the 24th Spring Conference on Computer Graphics
Lamar: a new pseudorandom number generator evolved by means of genetic programming
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Probabilistic inference strategy in distributed intrusion detection systems
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
The Multiple-Recursive Matrix Method for Pseudorandom Number Generation
Finite Fields and Their Applications
On the combination of self-organized systems to generate pseudo-random numbers
Information Sciences: an International Journal
| Hi-index | 0.00 |
The generalized feed back shift register (GFSR) algorithm suggested by Lewis and Payne is a widely used pseudorandom number generator, but has the following serious drawbacks: (1) an initialization scheme to assure higher order equidistribution is involved and is time consuming; (2) each bit of the generated words constitutes an m-sequence based on a primitive trinomials, which shows poor randomness with respect to weight distribution; (3) a large working area is necessary; (4) the period of sequence is far shorter than the theoretical upper bound. This paper presents the twisted GFSR (TGFSR) algorithm, a slightly but essentially modified version of the GFSR, which solves all the above problems without loss of merit. Some practical TGFSR generators were implemented and passed strict empirical tests. These new generators are most suitable for simulation of a large distributive system, which requires a number of mutually independent pseudorandom number generators with compact size.