The serial test for congruential pseudorandom numbers generated by inversions
Harald Niederreiter · Mathematics of Computation · 1989
Two types of congruential pseudorandom number generators based on inversions were introduced recently. We analyze the statistical independence properties of these pseudorandom numbers by means of the serial test. The results show that these pseudorandom numbers perform satisfactorily under the serial test. The methods of proof rely heavily on bounds for character sums such as the Weil-Stepanov bound for character sums over finite fields.