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:...
Main Authors: | Khaleel, Ghassan, Turaev, Sherzod, Alshaikhli, Imad Fakhri Taha, Mohd Tamrin, Mohd Izzuddin |
---|---|
Format: | Article |
Language: | English |
Published: |
Akademia Baru
2016
|
Subjects: | |
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 |
Similar Items
-
A symmetric cryptosystem based on nondeterministic finite automata
by: Khaleel, Ghassan, et al.
Published: (2017) -
A new block cipher based on finite automata systems
by: Khaleel, Ghassan, et al.
Published: (2016) -
A performance improvement of Domosi’s cryptosystem
by: Khaleel, Ghassan, et al.
Published: (2015) -
A performance improvement of Dömösi’s cryptosystem
by: Khaleel, Ghassan, et al.
Published: (2016) -
Performance and security improvements of Dӧmӧsi’s cryptosystem
by: Khaleel, Ghassan, et al.
Published: (2016)