# A symmetric cryptosystem based on nondeterministic finite automata

@inproceedings{Khaleel2017ASC, title={A symmetric cryptosystem based on nondeterministic finite automata}, author={Ghassan Khaleel and Sherzod Turaev and Imad Fakhri Alshaikhli and Tamara Zhukabayeva and Mohd Izzuddin Bin Mohd Tamrin}, year={2017} }

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.

#### Figures, Tables, and Topics from this paper

#### 2 Citations

A Comparative Performance Analysis of Modified Dӧmӧsi’s Cryptosystem and Data Encryption Standard

- Computer Science
- 2017

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

- Computer Science
- 2018

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

#### References

SHOWING 1-10 OF 12 REFERENCES

The generalization of public key cryptosystem FAPKC4

- Mathematics
- 1999

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. The… Expand

Break Finite Automata Public Key Cryptosystem

- Mathematics, Computer Science
- ICALP
- 1995

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

- Computer Science
- Journal of Computer Science and Technology
- 2008

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

- 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

- Mathematics
- 2009

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 sample… Expand

Two varieties of finite automaton public key cryptosystem and digital signatures

- Computer Science
- Journal of Computer Science and Technology
- 2008

Two varieties of the public key cryptosystem in [1] are given which can also be used to implement digital signatures and are given in this paper. Expand

On the Language Accepted by Finite Reversible Automata

- Mathematics, Computer Science
- ICALP
- 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

- Mathematics, Computer Science
- JACM
- 1982

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