Corpus ID: 37500553

A symmetric cryptosystem based on nondeterministic finite automata

  title={A symmetric cryptosystem based on nondeterministic finite automata},
  author={G. Khaleel and S. Turaev and I. Alshaikhli and T. Zhukabayeva and M. I. M. Tamrin},
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. 
A Comparative Performance Analysis of Modified Dӧmӧsi’s Cryptosystem and Data Encryption Standard
This paper aims to provide a framework and platform to evaluate a performance of Modified Dӧmӧsi’s Cryptosystem, a stream cipher based on finite automata, comparing to Data Encryption Standard. Expand
New Cryptosystem Based-on Permutation Matrix
The main objective of this research is to evaluate the security and the performance of the proposed cryptosystem as well as to promote the confusion and diffusion. Expand


The generalization of public key cryptosystem FAPKC4
FAPKC4, a public key cryptosystem based on automata theory, is generalized so that component automata of compound automata in user’ s public key would not be restricted to memory finite automata. TheExpand
Break Finite Automata Public Key Cryptosystem
This paper breaks a 10-year's standing public key cryptosystem, Finite Automata Public Key Cryptosystem (FAPKC), and proves a simple but previously unknown property of the input-memory finite automata. Expand
FAPKC3: A new finite automaton public key cryptosystem
A new system FAPKC3 is proposed which can be used for encryption and implementing digital signatures as well and its security is discussed. Expand
A One-Key Cryptosystem Based on a Finite Nonlinear Automaton
  • Marc Gysin
  • Computer Science
  • Cryptography: Policy and Algorithms
  • 1995
A finite nonlinear automaton for a one-key blockcipher cryptosystem is presented and the statistical properties measured on the ciphertext are satisfactory and in the same range as the properties of DES (Data Encryption Standard). Expand
On the k-reversibility of finite automata
It is a famous result of Angluin (1982 [1]) that there exists a time polynomial and space linear algorithm to identify the canonical automata of kreversible languages by using characteristic sampleExpand
Two varieties of finite automaton public key cryptosystem and digital signatures
This paper gives two varieties of the public key cryptosystem in [1] which can also be used to implement digital signatures.
On the Language Accepted by Finite Reversible Automata
  • J. Pin
  • Mathematics, Computer Science
  • 1987
Four non-trivial characterizations of the languages accepted by a reversible automaton equipped with a set of initial and final states are given and it is shown that one can effectively decide whether a given rational (or regular) language can be accepted by the automaton. Expand
Inference of Reversible Languages
An efficient algonthrn is presented for mfernng reversible languages from posmve and negative examples, and it is shown that it leads to correct identification m the hmlt of the class of reversible languages. Expand
Al-Shaikhli, “A Performance Improvement of Dӧmӧsi’s Cryptosystem
  • AIP Conference Proceedings 1705,
  • 2016