Efficient chaos shift keying method based on the second error derivative anti-synchronization detection

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.