Generalized Lehmer-Tausworthe random number generators
We study a general class of random number generators which includes Lehmer's congruential generator and the Tausworthe shift-register generator as special cases. The generators in this class use a general linear recurrence relation defined by a primitive polynomial over a large finite field. This generator, like the Tausworthe generator, has the property of the kspace equi-distribution. We give some theoretical and heuristic justincation for its asymptotic uniformity as well as asymptotic independence from a statistical theory viewpoint. In this paper, we also propose an efficient method of nnding primitive polynomials in a large finite fieid. Several generators with extremely long cycles are presented.
Proceedings of the 30th Annual Southeast Regional Conference, ACM-SE 1992
Deng, L., Rousseau, C., & Yuan, Y. (1992). Generalized Lehmer-Tausworthe random number generators. Proceedings of the 30th Annual Southeast Regional Conference, ACM-SE 1992, 108-115. https://doi.org/10.1145/503720.503738