Autómatas celulares no uniformes enfocados en el cifrado de Vernam

Abstract

In 1948 the Hungarian mathematician Jhon Von Neumman presented a paper on machines that could self-replicate at the Hixon symposium, Pasadena California. He at that time had not devised a particular example of such a machine. His colleague, the Polish mathematician Stanislaw Ulam, suggested that he use the cell concept (theoretical model based on the idea of ​​a cellular automaton). Cellular automata are wonderful tools, since their initial configuration is quite simple, but they produce complex phenomena and patterns, which many physicists and scientists admire to the point that they say that cellular automata shape our universe. In this monograph, non-uniform one-dimensional cellular automata will be presented, which present a certain randomness for the use of the Vernam cipher. At the beginning of the tour there will be a brief introduction to the subject of cellular automata, in the second section a short look about cryptography and Vernam encryption is presented, later the best candidates of the cellular automata that generate high-quality pseudorandom number sequences; and finally, how to use the cellular automata in a cryptographic model.