Skip to Main Content
This article mainly describes a way of designing an efficient pseudo-random number generator. Combining that the cellular automaton has many characteristics, such as simple rules of the component units, the local connectivity of units, the high degree of parallelism in information processing, and the complicated global characteristics, we use the rule 30 of one-dimensional cellular automaton to drive the state change. Finally, the pseudo-random numbers produced from the generator are tested the performance. And the results show that this design can be better applied to cryptography to ensure information technology and network security.