Table 1: Approximate full-cycle lengths of test generators
Cycle Length | |
---|---|
Plauger ANSI C [10] | 1.1*109 |
quick, portable generator [1] | 2.1*109 |
combination generator [1] (lower bound) | 2.3*1018 |
Math77 ([5], p. 3.1.-5) | 6.9*1010 |
Knuth line 26 ([6], p. 102) | 1.1*109 |
Knuth line 27 ([6], p. 102) | 2.1*109 |
Fibonacci sequence ([6], p. 26) | 1.1*109 |
Knuth subtractive ([6], pp. 171-173) | 3.6*1016 |
Marsaglia-Zaman-Tsang Ranmar ([4], pp. 339-341) | 2*1043 |
Marsaglia-Zaman-James Acarry ([4], pp. 341-342) | 3*10171 |
Linear Shift Register [8] | 1.8*1075 |
Moshier drand [11] | 6.9*1012 |
the infamous RANDU ([6], p. 104) | 1.1*109 |
Approximate factoring algorithm (Park and Miller) | 2.1*109 |
Compiler's library generator | 1.1*109 |