Cellular Automata in Cryptography. Part 1
Cellular automata, known for more than 70 years, are one of the oldest computational models. Emerged in the late 40-ies of the XX century, the theory of cellular automata has given many theoretical and practical applications in the form of computational models for various natural facts and phenomena. Cellular automata are widespread and ubiquitous. They are independent objects of theoretical study, as well as a modeling tool in science and technology. The popularity of cellular automata is based on their relative simplicity combined with numerous possibilities for modeling sets of interconnected homogeneous objects. Besides that, cellular automata, as parallel structures, are perfectly useful for modeling discrete parallel processes, for creating parallel algorithms for information processing and are also a basis of computer technology with a highly parallel architecture.