Abstract
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 automata. Moreover, it is proven that the introduced cryptosystem has higher security and more efficient performance than its deterministic counterparts – Dӧmӧsi’s cryptosystem and its modified version.
Original language | English |
---|---|
Pages (from-to) | 1489-1498 |
Number of pages | 10 |
Journal | Journal of Theoretical and Applied Information Technology |
Volume | 95 |
Issue number | 6 |
Publication status | Published - Mar 31 2017 |
Externally published | Yes |
Keywords
- Cryptography
- Dӧmӧsi’s cryptosystem
- Nondeterministic finite automata
- Stream cipher
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)