Abstract
Dynamical systems play a central role in the design of symmetric cryptosystems. Their use has been widely investigated both in "chaos-based" private communications and in stream ciphers over finite fields. In the former case, they take the form of automata named Moore or Mealy machines. The main charateristic of stream ciphers lies in that they require synchronization of complex sequences generated by the dynamical systems involved both at the transmitter and the receiver ends. In this paper, we focus on a special class of symmetric ciphers, namely the Self-Synchronizing Stream Ciphers. Indeed, such ciphers have not been seriously explored so far although they show interesting properties of synchronization which could make them very appealing in practice. We review and compare different design approaches which have been proposed in the open literature, and fully-specified algorithms are detailed for illustration purposes. Open issues related to the validation and the implementation of Self-Synchronizing Stream Ciphers are developed. We highlight the reason why some concepts borrowed from control theory appear to be useful to this end.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
