Invertibility, flatness and identifiability of switched linear dynamical systems: An application to secure communications

This paper deals with invertibility, flatness and identifiability of switched linear dynamical systems. Based on these concepts, a framework which enables to test whether, from a structural point of view, a switched linear dynamical system can act as a cryptosystem for secure communications is proposed.

[1]  M. Fliess,et al.  Flatness and defect of non-linear systems: introductory theory and examples , 1995 .

[2]  Maciej Ogorzalek,et al.  Taming chaos. I. Synchronization , 1993 .

[3]  Martin Hasler,et al.  Synchronization of chaotic systems and transmission of information , 1998 .

[4]  Helmut Knebl,et al.  Introduction to Cryptography , 2002, Information Security and Cryptography.

[5]  Louis M. Pecora,et al.  Synchronizing chaotic circuits , 1991 .

[6]  S. Sastry,et al.  An algebraic geometric approach to the identification of a class of linear hybrid systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[7]  Sunil K. Agrawal,et al.  Differentially Flat Systems , 2004 .

[8]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[9]  Tao Yang,et al.  A SURVEY OF CHAOTIC SECURE COMMUNICATION SYSTEMS , 2004 .

[10]  Jamal Daafouz,et al.  A connection between chaotic and conventional cryptography , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[11]  Joan Daemen,et al.  The Self-synchronizing Stream Cipher Moustique , 2008, The eSTREAM Finalists.