Dynamic behaviour of network cellular automata with non-chaotic standard rules

Rules classified as non-chaotic are usually discarded from the set of keys in cellular automata used as criptographic methods, as they exhibit predictable behavior regarding the dynamic evolution of the cellular automata configurations. The number of possible keys, in fact, is an important factor for the security of a cryptographic method. This paper investigates the dynamic behavior of a type of cellular automata network whose structure is derived from small-word concepts, when evolving rules not classified as chaotic. The constructed connection structure of the cellular automata network modifies the dynamic behavior of transition rules associated to the standard model. The experiments show that rules classified as periodical are capable of producing results equivalent to those by chaotic rules, thus suggesting the use of such structures as better candidates for criptography applications than standard cellular automata.