In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.
Dömösi, P. and Nehaniv, C. L., Algebraic Theory of Automata Networks: An Introduction, ser. SIAM monographs on Discrete Mathematics and Applications, vol. 11, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2005, doi 10.1137/1.9780898718492.
Gécseg, F. , Products of Automata, ser. EATCS Monographs on Theoretical Computer Science, vol. 7, Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1986, doi 10.1007/978-3-642-61611-2.
Gécseg, F. and Peák, I., Algebraic Theory of Automata, Ser. Disquisitiones Mathematicae Hungaricae, vol. 2, Akadémia Kiadó, Budapest, 1972.
Hopcroft, J. E., Motwani, R. and Ullman, J. D., Introduction to Automata Theory, Languages and Computation, second edition, Addison-Wesley seriesin computer science, Addison-Wesley, 2001.
Menezes, A. J., Oorschot, P. C. and Vanstone, S. A., Handbook of Applied Cryptography, ser. Discrete Mathematics and Its Applications, CRC Press, 1996, doi 10.1201/9781439821916.
Tao, R. , Finite Automata and Application to Cryptography, Springer-Verlag, Berlin, 2009, doi. 10.1007/978-3-540-78257-5.