An overview of cryptosystems based on finite automata
Ghassan Khaleel, Sherzod Turaev, Imad Fakhri Taha Alshaikhli, Mohd Izzuddin Mohd Tamrin · 2016
Finite automata are backbones of the cryptosystems based on language theory. Most of the cryptosystems based on grammars and word problems are either insecure or do not satisfy digital signature prosperities. Basically, the cryptosystems based on automata are classified into cryptosystems based on: transducers, cellular automata and acceptors (i.e., finite automata without outputs). In this paper, we discuss the advantages and disadvantages of the important cryptosystems based on finite automata such as FAPKC, Gysin, Wolfram, Kari, Dӧmӧsi’s cryptosystems and modified Dӧmӧsi’s cryptosystems.