The Lattice of Machine Invariant Sets and Subword Complexity

Details The Lattice of Machine Invariant Sets and Subword Complexity The Lattice of Machine Invariant Sets and Subword Complexity

2005-02-14

arxiv.org/abs/cs/0502064v1

Computer Science

Cryptography and Security

9 pages, extended abstract published in 67th Workshop on General Algebra

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Lattice of Machine Invariant Sets and Subword Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Lattice of Machine Invariant Sets and Subword Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Lattice of Machine Invariant Sets and Subword Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-413289