Skip to main navigation Skip to search Skip to main content

A symmetric cryptosystem based on nondeterministic finite automata

  • Ghassan Khaleel
  • , Sherzod Turaev
  • , Imad Alshaikhli
  • , Tamara Zhukabayeva
  • , M. Izzuddin M. Tamrin

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)1489-1498
Number of pages10
JournalJournal of Theoretical and Applied Information Technology
Volume95
Issue number6
Publication statusPublished - Mar 31 2017
Externally publishedYes

Keywords

  • Cryptography
  • Dӧmӧsi’s cryptosystem
  • Nondeterministic finite automata
  • Stream cipher

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'A symmetric cryptosystem based on nondeterministic finite automata'. Together they form a unique fingerprint.

Cite this