A symmetric cryptosystem based on nondeterministic finite automata
This paper proposes a new symmetric cryptosystem based on nondeterministic finite automata. It is shown that nondeterminism allows to reduce the dependency of key automata on a large descriptional complexity and irreversibility of the automata. Moreover, it is proven that the introduced cryptosystem...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Asian Research Publishing Network (ARPN)
2017
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/53715/ http://irep.iium.edu.my/53715/ http://irep.iium.edu.my/53715/2/53715_A%20symmetric%20cryptosystem_SCOPUS.pdf http://irep.iium.edu.my/53715/13/53715_Symmetric%20cryptosystems%20based%20on%20finite%20automata.pdf |
| Summary: | This paper proposes a new symmetric cryptosystem based on nondeterministic finite automata. It is shown that nondeterminism allows to reduce the dependency of key automata on a large descriptional complexity and irreversibility of the automata. Moreover, it is proven that the introduced cryptosystem has higher security and more efficient performance than its deterministic counterparts, Domosi’s cryptosystem and the modified Domosi’s cryptosystem. |
|---|