Self-Synchronizing Stream Ciphers and Dynamical Systems: State of the Art and Open Issues
نویسندگان
چکیده
synchronizing stream ciphers and dynamical systems: state of the art and open issues. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau recherche, publiés ou non, ´ emanant desétablissements d'enseignement et de recherche français oú etrangers, des laboratoires publics ou privés. 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 get the form of automata named as 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 at the transmitter and the receiver part. 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 get 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 purpose. Open issues related to the validation and the implementation of Self-Synchronizing Stream Ciphers are developped. We highlight the reason why some concepts borrowed from control theory appear to be useful to this end.
منابع مشابه
Designing Self-Synchronizing Stream Ciphers with Flat Dynamical Systems
In this paper, we present properties of dynamical systems and their use for cryptographical applications. In particular, we study the relationship with the self-synchronizing stream ciphers from a structural point of view. A special class of dynamical systems, namely the piecewise linear systems, are then considered. I. I The main objective of the paper is to show how dynamical syste...
متن کاملBoolean Functions: Cryptography and Applications
In this paper, we present properties of dynamical systems and their use for cryptographical applications. In particular, we study the relationship with the self-synchronizing stream ciphers from a structural point of view. Finally a framework involving discrete Lyapunov exponents and Walsh transform is sketched to characterize the dynamical behaviors.
متن کاملNon-Linearity and Security of Self Synchronizing Stream Ciphers
Several proposed chaos based ciphers exploit the ergodic property of chaotic orbits. As chaotic systems are unstable and have sensitive dependence on initial conditions, the main difficulty for the receiver is to reproduce the chaotic signal that has been generated by the sender in order to correctly decrypt the message. This is performed by a self synchronizing device. In discrete cryptography...
متن کاملNew Directions in Cryptanalysis of Self-Synchronizing Stream Ciphers
In cryptology we commonly face the problem of finding an unknown key K from the output of an easily computable keyed function F (C,K) where the attacker has the power to choose the public variable C. In this work we focus on self-synchronizing stream ciphers. First we show how to model these primitives in the above-mentioned general problem by relating appropriate functions F to the underlying ...
متن کاملChosen Ciphertext Attack on a New Class of Self-Synchronizing Stream Ciphers
At Indocrypt’2002, Arnault et al. proposed a new class of self-synchronizing stream ciphers combining LFSR and FCSR architectures. It was claimed to be resistant to known attacks. In this paper, we show that such a self-synchronizing stream cipher is extremely vulnerable to chosen ciphertext attack. We can restore the secret keys easily from one chosen ciphertext with little computation. For th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 20 شماره
صفحات -
تاریخ انتشار 2010