The Lattice of Machine Invariant Sets and Subword Complexity

Simple item page
dc.creatorBuls, Janis
dc.date2005-02-14
dc.date.accessioned2026-07-07T03:22:32Z
dc.date.available2026-07-07T03:22:32Z
dc.descriptionWe 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.
dc.description9 pages, extended abstract published in 67th Workshop on General Algebra
dc.identifierhttps://arxiv.org/abs/cs/0502064
dc.identifierhttp://arxiv.org/abs/cs/0502064
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32633
dc.subjectCryptography and Security
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectD.2.8;D.4.6;E.3;F.1.1;F.1.3;F.4.3
dc.titleThe Lattice of Machine Invariant Sets and Subword Complexity
dc.typetext

Files

Collections

arXiv