An asymptotically perfect pseudorandom generator

A transformation of binary sequences that is ergodic and mixing with respec t to the equidistributed measure is constructed with the help of a cellular automaton. The transformation is the basic element for a pseudorandom numb er generator. The ratio of the number of seeds that generate equidistribute d sequences to the number of all words goes to one as the length of words i s increased. The evaluation of a hardware implementation of the generator c onfirms the statistical behavior of sequences as determined from the ergodi c properties of the mathematical model of the generator. Unpredictability u nder random search attacks is attained by means of three coupled transforma tions.