Implementation of Encryption Using Glushkov Product of Automata

Abstract

This article discusses the software implementation of an encryption algorithm based on the Glushkov product of finite automata. The main focus of this work is on the application of this mathematical model in cryptography, which allows formalizing the process of key generation and construction of block ciphers. The paper provides a theoretical overview of finite automata without output, their properties and features, as well as a formal definition of the Glushkov product. The encryption algorithm is described, its stages are detailed, including the construction of a key automaton and the process of encryption and decryption of data. To confirm the effectiveness of the proposed method, its software implementation in Python was carried out. Experimental results demonstrate the practical applicability of the algorithm, its cryptographic resistance and potential directions for further development. The study shows that the Glushkov product can serve as a basis for the development of new cryptographic schemes with a high degree of protection.

Keywords

• Finite automata
• Product Glushkov
• Permutation automaton
• Cryptography
• Automata theory

References

1. Saukhanova, Z., Sharipbay, A., Shakhmetova, G., Barlybayev, A., Sayat, R., & Altay, K. (2025). Implementation of encryption using Glushkov product of automata. The Eurasia Proceedings of Science, Technology, Engineering and Mathematics (EPSTEM), 33, 62-72.