EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Hi-index | 0.00 |
Knuth [The Art of Computer Programming, vol. 2: Semi-Numerical Algorithms, 3rd ed., Addison-Wesley, Reading, MA, 1997] shows that iterations of a random function perform poorly on average as a random number generator. He proposes a generalization in which the next value depends on two or more previous values. This note demonstrates, via an analysis of the cycle length of a random k-ary map, the equally poor performance of a random instance in Knuth's more general model.