Analysis of sequences generated by ELCA-type Cellular Automata targeting noise generation

The Equal Length Cellular Automata (ELCA) are suggested as a mean for generating pseudo-random sequences. For supporting this application, an analysis of the randomness of the generated sequences is performed for a variety of automata, using several analysis methods. The results of the analysis are presented and discussed. In addition, the complexity of the generation method is compared with other types of pseudo-chaotic generators. Potentiality of usage in noise generating application targeting security of data in microsystems is envisaged.