A CA Randomizers Based on parallel CAs with Balanced Rules

In this paper a class of cellular automata rules is defined and proposed to be used in CA randomizers. The quality of the proposed rules is shown by study of symmetric rules of radius one and two. In addition, a non-uniform CA randomizer is constructed with the proposed symmetric rules of radius two. The high quality of the generated random numbers are shown by a battery of statistical tests. Moreover, it is shown that the proposed CA randomizer is more secure against cryptanalysis attacks.