Theory of a class of complemented group cellular automata and its application to cryptography
The present paper characterizes a specific class of complemented group cellular automata(CA). The transition of the CA divides the entire state space into smaller spaces of equal lengths. Some interesting properties of this class of Cellular Automata have been analyzed. The relations developed promise applications in constructing block ciphers and key agreement algorithms.
cryptography state spaces cellular automaton (ca) complemented ca group length key agreement protocols