Thesis supervisor: Géza Horváth
Location of studies (in Hungarian): University of Debrecen Faculty of Informatics Abbreviation of location of studies: DE IK
Description of the research topic:
Syllabus
Automata theory provides a natural basis for designing cryptosystems and several such systems have been designed. Some of them are based on Mealy automata, some of them are based on cellular automata, while others are based on compositions of finite automata.
In this program we are going to investigate present cryptosystems based on finite automata and finite automata networks.
We are going to develop novel symmetric cryptosystems and other cryptographic primitives: one-way hash functions and cryptographically secure pseudorandom number generators, based on finite automata.
Finally, we are going to do a security and performance analysis of the novel systems.
Bibliography
1. Douglas R. Stinson: Cryptography: Theory and Practice. CRC Press, 1995.
2. Pál Dömösi and Chrystopher L. Nehaniv: Algebraic Theory of Automata Networks. An Introduction. Siam, 2005.
3. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation (3rd edition). Addison-Wesley, 2006.
4. Renji Tao: Finite Automata and Application to Cryptography. Springer, 2009.
5. Géza Horváth and Benedek Nagy: Formal Languages and Automata Theory. Typotex, 2014.
Login
