Thesis supervisor: Géza Horváth
Location of studies (in Hungarian): Debreceni Egyetem Informatikai Kar Abbreviation of location of studies: DE IK
Description of the research topic:
The concept of Gluškov product was introduced by V. M. Gluškov in 1961. It was intensively studied by several scientists since the middle of 60’s. Contrary of the large number of excellent publications, application of Gluškov-type products of automata in cryptography did not arise until recent past, when Pál Dömösi and Géza Horváth introduced novel block ciphers based on the composition of abstract finite automata without outputs. Although these recently introduced cryptosystems satisfy all conditions of a modern block cypher, there are several other possibilities to design cryptosystems, pseudorandom-generators and other cryptographical applications based on automata network.
Bibliography
1. Pál Dömösi, Crytopher L. Nehaniv, Algebraic Theory of Automata Networks: An Introduction, SIAM, 2005.
2. Douglas R. Stinson, Cryptography, Theory and Practice, Third Edition, CRC press, 2005.
3. Johannes A. Buchmann, Introduction to Cryptography, Second Edition, Springer, 2004.
Recommended language skills (in Hungarian): angol Number of students who can be accepted: 1
Login
