A Scalable Clock Controlled Generator Based on Cellular Automata

A class of cellular automata rules is given by combining the isomorphic characteristics of the 90/150 additive cellular automata and the principle that the entropy of sequences is maximal when using the reverse rules. And the feasibility that the cellular automata using the given rules can generate high-quality pseudo-random numbers is analyzed. Then a scalable clock controlled generator based on the A5 stream cipher structural framework is constructed by using the given rules. The analysis and simulation results show that such clock-controlled generator structure has excellent scalability, the pseudo-random sequence generated by using this method has good statistical properties, and relative to the original A5 stream cipher algorithm, this method increases the resistance to brute force attack.