An overview of cryptosystems based on finite automata

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:...

Full description

Bibliographic Details
Main Authors:	Khaleel, Ghassan, Turaev, Sherzod, Alshaikhli, Imad Fakhri Taha, Mohd Tamrin, Mohd Izzuddin
Format:	Article
Language:	English
Published:	Akademia Baru 2016
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://irep.iium.edu.my/52954/ http://irep.iium.edu.my/52954/ http://irep.iium.edu.my/52954/1/ARSRV27_N1_P1_7.pdf

id	iium-52954
recordtype	eprints
spelling	iium-529542016-12-03T07:14:21Z http://irep.iium.edu.my/52954/ An overview of cryptosystems based on finite automata Khaleel, Ghassan Turaev, Sherzod Alshaikhli, Imad Fakhri Taha Mohd Tamrin, Mohd Izzuddin QA75 Electronic computers. Computer science 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. Akademia Baru 2016 Article PeerReviewed application/pdf en http://irep.iium.edu.my/52954/1/ARSRV27_N1_P1_7.pdf 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 http://www.akademiabaru.com/doc/ARSRV27_N1_P1_7.pdf
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English
topic	QA75 Electronic computers. Computer science
spellingShingle	QA75 Electronic computers. Computer science Khaleel, Ghassan Turaev, Sherzod Alshaikhli, Imad Fakhri Taha Mohd Tamrin, Mohd Izzuddin An overview of cryptosystems based on finite automata
description	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.
format	Article
author	Khaleel, Ghassan Turaev, Sherzod Alshaikhli, Imad Fakhri Taha Mohd Tamrin, Mohd Izzuddin
author_facet	Khaleel, Ghassan Turaev, Sherzod Alshaikhli, Imad Fakhri Taha Mohd Tamrin, Mohd Izzuddin
author_sort	Khaleel, Ghassan
title	An overview of cryptosystems based on finite automata
title_short	An overview of cryptosystems based on finite automata
title_full	An overview of cryptosystems based on finite automata
title_fullStr	An overview of cryptosystems based on finite automata
title_full_unstemmed	An overview of cryptosystems based on finite automata
title_sort	overview of cryptosystems based on finite automata
publisher	Akademia Baru
publishDate	2016
url	http://irep.iium.edu.my/52954/ http://irep.iium.edu.my/52954/ http://irep.iium.edu.my/52954/1/ARSRV27_N1_P1_7.pdf
first_indexed	2023-09-18T21:15:00Z
last_indexed	2023-09-18T21:15:00Z
_version_	1777411502931705856

An overview of cryptosystems based on finite automata

Similar Items