Mgr. Volodymyr Lynnyk, Ph.D.

In this paper, a modified version of the Chaos Shift Keying (CSK) scheme for secure encryption and decryption of data will be discussed. The classical CSK method determines the correct value of binary signal through checking which initially unsynchronized sys- tem is getting synchronized. On the contrary, the new anti-synchronization CSK (ACSK) scheme determines the wrong value of binary signal through checking which already syn- chronized system is loosing synchronization. The ACSK scheme is implemented and tested using the so-called generalized Lorenz system (GLS) family making advantage of its special parametrization. Such an implementation relies on the parameter dependent synchroniza- tion of several identical copies of the GLS obtained through the observer-based design for nonlinear systems. The purpose of this paper is to study and compare two different meth- ods for the anti-synchronization detection, including further underlying theoretical study of the GLS.

This paper studies a new modication of the anti-synchronization chaos shift keying scheme for the secure encryption and decryption of data. A new concept of the detection of the correct/incorect binary value in the receiver is used. The method proposed here requires very reasonable amount of data to encrypt and time to decrypt a single bit. Basically, to encrypt a single bit, only one iteration is needed. Moreover, the security of this method is systematically investigated showing its good resistance to typical decryption attacks. Theoretical results are supported by the numerical simulations.

This paper studies yet another improvement of the anti-synchronization chaos shift keying scheme for the secure encryption and decryption of the digital data. A new concept of the detection of the correct binary value in the receiver is introduced here. The proposed method requires very reasonable amount of data to encrypt and time to decrypt one bit. Basically, to encrypt one bit, only one iteration (i.e. only one real number of 6 valid digits) is needed. At the same time, thanks to the anti-synchronization detection based on the synchronization error second derivative, almost 100% of the carrying chaotic signal can be used. The security of the proposed method can be systematically investigated showing its good resistance against typical decryption attacks. The theoretical analysis of the introduced method is supported by the numerical experiments with digital data encryption.

In this paper, a modified version of the Chaos Shift Keying (CSK) scheme for secure encryption and decryption of data is proposed. The proposed scheme uses the effect of anti-synchronization, rather than synchronization. More specifically, the classical CSK method determines the correct value of binary signal through checking which unsynchronized system is getting synchronized. On the contrary, our novel method determines wrong value of binary signal through checking which already synchronized system is loosing synchronization. Our method is implemented and thoroughly tested on the recently introduced generalized Lorenz system (GLS) family making advantage of its special parametrization. The proposed scheme relies on parameter depended synchronization obtained through observer-based design for nonlinear systems.

The aim of this paper is to study synchronization of dynamical complex network consisting of nodes being generalized Lorenz chaotic systems and connections are created with transmitted synchronizing signals. Focus is on the robustness of the network synchronization with respect to its connectional structure.

In this paper, a modified version of the Chaos Shift Keying scheme for secure encryption and decription of data is proposed. The proposed scheme uses the effect of anti-synchronization, rather than synchronization. More specifically, the classical CSk method determines the correct value of binary signal through checking which unsynchronized system is getting synchronized. On the contrary, our novel method determines wrong value of binary signal through checking which already synchronized system is loosing synchronization. The advantage of the proposed method is two-fold. First, it requires very reasonable amount of data to encrypt and time to decrypt a single bit. Secondly, its security can be investigated and estimated as practically unbreakable.

This paper studies possible application of the observerbased chaos synchronization to secure encryption. Unlike common approaches that use continuous time synchronized chaos for the so-called chaotic masking, the chaos shift keying (CSK) is being used here. CSK uses piece of synchronized chaotic signal to encode directly a given symbol. This paper uses properties of observer-based synchronization to achieve reasonable amount of information per symbol, moreover, specific properties of dependence of this observer-based synchronization on parameters make possible direct encryption of multi-alphabet symbols. Such a breakthrough is enabled by using anti-synchronization effect, rather than the synchronization one. Our method, further referred as the anti-synchronization chaos shift keying (ACSK), is implemented and thoroughly tested on the recently introduced generalized Lorenz system (GLS) family making advantage of its special parametrization.

This paper studies possible application of the observerbased chaos synchronization to secure encryption. Unlike common approaches that use continuous time synchronized chaos for the so-called chaotic masking, the chaos shift keying (CSK) is being used here. CSK uses piece of synchronized chaotic signal to encode directly a given symbol. This paper uses properties of observer-based synchronization to achieve reasonable amount of information per symbol, moreover, specific properties of dependence of this observer-based synchronization on parameters make possible direct encryption of multi-alphabet symbols. Such a breakthrough is enabled by using anti-synchronization effect, rather than the synchronization one. Our method, further referred as the anti-synchronization chaos shift keying (ACSK), is implemented and thoroughly tested on the recently introduced generalized Lorenz system (GLS) family making advantage of its special parametrization.