An overview of cryptosystems based on finite automata

Khaleel, Ghassan and Turaev, Sherzod and Alshaikhli, Imad Fakhri Taha and Mohd Tamrin, Mohd Izzuddin (2016) An overview of cryptosystems based on finite automata. Journal of Advanced Review on Scientific Research, 27 (1). pp. 1-7. ISSN 2289-7887

Preview

PDF (open access article) - Published Version Download (258kB) | Preview

Abstract

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.

Item Type:	Article (Journal)
Additional Information:	6846/52954
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Information System Kulliyyah of Information and Communication Technology > Department of Information System
Depositing User:	Mohd Izzuddin Mohd Tamrin
Date Deposited:	03 Dec 2016 15:14
Last Modified:	03 Dec 2016 15:14
URI:	http://irep.iium.edu.my/id/eprint/52954

Actions (login required)

View Item