A generalization of the cellular automata rule-30 cryptoscheme

Cellular automata are powerful dynamical systems which provide a robust environment for developing a data encryption standard. We extend Wolfram´s rule 30 and obtain a reversible cellular automaton having an inverse with unboundedly large domain. An alternative cryptogram is presented which combines the extended Wolfram´s cryptographic approach with the one of cellular automaton transforms.