Аннотация
The article provides an overview of cryptographic systems based on finite automata. Theoretical materials of domestic scientists in foreign publications on finite-automaton cryptography have been studied. For a better understanding of the operation of various types of finite automata models, definitions of the main concepts were given: finite automaton – recognizer, finite automaton - converter, reversibility with a delay, inverse automaton, permutation and composition of finite automata. Further in the article, cryptographic algorithms based on automata without an exit were described, their advantages and disadvantages were noted. At the end, information is given about finite automata models, which are based on an automaton with an exit. The advantages of the finite automaton model over the existing algorithms of classical cryptography are revealed. The study allows us to make a conclusion about the prospects of using finite automata as the basis for cryptographic algorithms.