Left invertibility, flatness and identifiability of switched linear dynamical systems: a framework for cryptographic applications

The purpose of this article is to illustrate the potential interest of the control theory framework for cryptographic applications. It is shown that under the properties of left invertibility and flatness, dynamical systems are structurally equivalent to some specific cryptographic primitives called self-synchronising stream ciphers. After having motivated the interest of considering hybrid systems for such ciphers, the development is particularised for the special class of switched linear systems. We also show that identifiability is a necessary condition for security, and we describe an identification procedure as a possible attack and assess its complexity.