An asymptotically perfect pseudorandom generator
Marcela Mejía J. Urías
Discrete & Continuous Dynamical Systems - A 2001, 7(1): 115-126 doi: 10.3934/dcds.2001.7.115
A transformation of binary sequences that is ergodic and mixing with respect to the equidistributed measure is constructed with the help of a cellular automaton. The transformation is the basic element for a pseudorandom number generator. The ratio of the number of seeds that generate equidistributed sequences to the number of all words goes to one as the length of words is increased. The evaluation of a hardware implementation of the generator confirms the statistical behavior of sequences as determined from the ergodic properties of the mathematical model of the generator. Unpredictability under random search attacks is attained by means of three coupled transformations.
keywords: pseudorandom sequences. Cellular automata ergodic transformations

Year of publication

Related Authors

Related Keywords

[Back to Top]