USAGE OF CELLULAR AUTOMATON IN SYMMETRIC-KEY ALGORITHM
The article describes a symmetric-key algorithm with block cipher which generates round keys using nonreversible chaotic cellular automata ("Seeds" - described by the rule B2/S). Author offers the following procedures of conversion: the first one converts a string represented as a byte array to cellular automata state and the second one makes reverse action. Auxiliary transposition, shift and diffusion methods for each round of the algorithm are shown. Differences between this cryptosystem and the classical ones are de­scribed. The main feature of this algorithm is round key size dependency on initial key (password) and number of generations in cellular automaton. The algorithm has avalanche effect and can be practically used.