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:...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Akademia Baru
2016
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/52954/1/ARSRV27_N1_P1_7.pdf http://irep.iium.edu.my/52954/ http://www.akademiabaru.com/doc/ARSRV27_N1_P1_7.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|