Abstract

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 k-space equi-distribution. We give some theoretical and heuristic justification for its asymptotic uniformity as well as asymptotic independence from a statistical theory viewpoint. In this paper, we also propose an efficient method of finding primitive polynomials in a large finite field. Several generators with extremely long cycles are presented.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.