Construction of dead-beat switched automata: application to cryptography
Résumé
The work is concerned with dead-beat stability of autonomous discrete-time switched linear systems, having in mind a potential application to cryptography. As far as control theory is concerned, we propose an algorithm to construct a switched system whose shorter dead-beat stabilizing sequence has a prescribed length. We discuss the pecularities when the dynamical systems under consideration are defined over finite fields. Then, it is shown how the algorithm can be used to addressed the design of self-synchronizing stream ciphers involving switched automata.
Domaines
AutomatiqueOrigine | Fichiers produits par l'(les) auteur(s) |
---|