A fast method of generating digital random numbers

In this article we propose a fast, efficient technique for generating a pseudorandom stream of uniformly-distributed numbers. The arithmetic operations required are an L bit exclusive-or, a rotation, and a shift to update the state of the number generator. With moderately large values of L we have been able to generate sequences of numbers whose periods are quite long (on the order of 2 × 10⁷ long). Its simplicity of construction, as well as its ability to generate long streams of independent pseudorandom uniformly-distributed integers make this noise generator a worthy candidate for use in high-speed digital systems.