A Novel Cryptosystem Based on Gluskov Product of Automata

@article{Dmsi2015ANC,
  title={A Novel Cryptosystem Based on Gluskov Product of Automata},
  author={P. D{\"o}m{\"o}si and G. Horv{\'a}th},
  journal={Acta Cybern.},
  year={2015},
  volume={22},
  pages={359-371}
}
The concept of Gluškov product was introduced by V. M. Gluškov in 1961. It was intensively studied by several scientists (first of all, by Ferenc Gécseg and the automata-theory school centred around him in Szeged, Hungary) since the middle of 60’s. In spite of the large number of excellent publications, no application of Gluškov-type products of automata in cryptography has arisen so far. This paper is the first attempt in this direction. 
Key optimization for automata network based cryptosystems ∗
The concept of Glu2kov product was introduced by V. M. Glu2kov in 1961. It was intensively studied by several scientists since the middle of 60's. Contrary of the large number of excellentExpand
Statistical Analysis of DH 1 Cryptosystem
In this paper we shall use some standard statistical methods to test the avalanche effect of a previously introduced cryptosystem based on automata compositions, called DH1 cryptosystem. We haveExpand
Application of finite automata in cryptography
TLDR
The article describes important concepts of symmetric and asymmetric cryptosystems, and the technologies of applying the finite automaton model in information encryption. Expand
Some Remarks and Tests on the Dh1 Cryptosystem Based on Automata Compositions
TLDR
NIST test results of a previously introduced cryptosystem based on automata compositions are discussed and it is concluded that the requirements of NIST test are all fulfilled by the cryptos system. Expand

References

SHOWING 1-10 OF 22 REFERENCES
A Cryptosystem Based on the Composition of Reversible Cellular Automata
TLDR
A working key generation algorithm is developed for a public-key cryptosystem based on reversible cellular automata originally conceived by Kari by showing that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. Expand
Break Finite Automata Public Key Cryptosystem
TLDR
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
Analysis of Pseudo Random Sequence Generated by Cellular Automata
TLDR
It is shown that key search can be reduced considerably if one is contented to succeed only with a certain success probability, established by an information theoretic analysis of arbitrary key saurces with non-uniform probability distribution. Expand
A One-Key Cryptosystem Based on a Finite Nonlinear Automaton
  • Marc Gysin
  • Computer Science
  • Cryptography: Policy and Algorithms
  • 1995
TLDR
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 Finite Automaton Public-Key Cryptosystem
TLDR
This paper gives a feasible inversion algorithm for compound finite automaton, of which one component belongs to quasi-linear finite automata and the other component belonging to a kind of weakly invertible or weak inverse finite Automata generated by linear R a R b inverse transformation. Expand
Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT'91
TLDR
Several properties of this cryptosystem are studied and two cryptanalytic attacks are described. Expand
Cryptosystems Based on Reversible Cellular Automata
We propose the use of reversible cellular automata (RCA) as eecient encryp-tion and decryption devices. The eeciency is due to their inherent parallelism. They can be used both as classicalExpand
Cryptography with Cellular Automata
TLDR
This abstract discusses a stream cipher based on a simple one-dimensional cellular automaton that can be obtained from binary plaintext P as usual according to Ci = Pi XOR a(i); the plaintext can be recovered by repeating the same operation, but only if the sequence a( i) is known. Expand
A class of coders based on GSM
TLDR
Using the definition of gsm and finite translators, a new class of coders is proposed and it is shown that ifM is a weakly-deterministic coder, thenM−1 is also a coder. Expand
Cryptanalysis of a Modified Rotor Machine
TLDR
In this modification the input to the permutation and the new position are equal and do not have to be computed separately. Expand
...
1
2
3
...