Introduction to finite fields and their applications
Introduction to finite fields and their applications
Efficient and portable combined random number generators
Communications of the ACM
Communications of the ACM - Special issue on simulation
A search for good multiple recursive random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Multiplicative, congruential random-number generators with multiplier ± 2k1 ± 2k2 and modulus 2p - 1
ACM Transactions on Mathematical Software (TOMS)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
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
Linear congruential generators of order K1
WSC '88 Proceedings of the 20th conference on Winter simulation
Beware of linear congruential generators with multipliers of the form a = ±2q ±2r
ACM Transactions on Mathematical Software (TOMS)
Coding the Lehmer pseudo-random number generator
Communications of the ACM
Shift Register Sequences
Efficient and portable multiple recursive generators of large order
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Stateless key distribution for secure intra and inter-group multicast in mobile wireless network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable parallel multiple recursive generators of large order
Parallel Computing
Wireless Personal Communications: An International Journal
Efficient computer search of large-order multiple recursive pseudo-random number generators
Journal of Computational and Applied Mathematics
Large-Order Multiple Recursive Generators with Modulus 231-1
INFORMS Journal on Computing
AusPDC '11 Proceedings of the Ninth Australasian Symposium on Parallel and Distributed Computing - Volume 118
| Hi-index | 0.00 |
We propose a system of multiple recursive generators of modulus p and order k where all nonzero coefficients of the recurrence are equal. The advantage of this property is that a single multiplication is needed to compute the recurrence, so the generator would run faster than the general case. For p = 231 − 1, the most popular modulus used, we provide tables of specific parameter values yielding maximum period for recurrence of order k = 102 and 120. For p = 231 − 55719 and k = 1511, we have found generators with a period length approximately 1014100.5.