Observability of Permutations, and Stream Ciphers

Robert E. Byerly, Lance D. Drager, Jeffrey M. Lee

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

We study the observability of a permutation on a finite set by a complex-valued function. The analysis is done in terms of the spectral theory of the unitary operator on functions defined by the permutation. Any function f can be written uniquely as a sum of eigenfunctions of this operator; we call these eigenfunctions the eigencomponents of f. It is shown that a function observes the permutation if and only if its eigencomponents separate points and if and only if the function has no nontrivial symmetry that preserves the dynamics. Some more technical conditions are discussed. An application to the security of stream ciphers is discussed.

Original languageEnglish
Pages (from-to)3326-3330+3350
JournalIEEE Transactions on Information Theory
Volume49
Issue number12
DOIs
StatePublished - Dec 2003

Keywords

  • Control theory
  • Dynamical systems
  • Observability
  • Permutations
  • Stream cipher

Fingerprint Dive into the research topics of 'Observability of Permutations, and Stream Ciphers'. Together they form a unique fingerprint.

Cite this