The Lattice of Machine Invariant Sets and Subword Complexity
Buls, Janis
Cryptography and Security
Computational Complexity
Discrete Mathematics
D.2.8;D.4.6;E.3;F.1.1;F.1.3;F.4.3
Original · EN
We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the lattice would serve as a measure of words cryptographic quality if we like to identify new stream ciphers suitable for widespread adoption.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.