Breaking projective chaos synchronization secure communication using filtering and generalized synchronization

Abstract

This paper describes the security weaknesses of a recently proposed secure communication method based on chaotic masking using projective synchronization of two chaotic systems. We show that the system is insecure and how to break it in two different ways, by high-pass filtering and by generalized synchronization.

14 pages, 6 figures, latex format

References in corpus (2)

• Breaking parameter modulated chaotic secure communication system
• Cryptanalysis of a novel cryptosystem based on chaotic oscillators and feedback inversion

Cited by in corpus (8)

• Cryptographic requirements for chaotic secure communications
• Using a reservoir computer to learn chaotic attractors, with applications to chaos synchronisation and cryptography
• Chaos on compact manifolds: Differentiable synchronizations beyond the Takens theorem
• Return-Map Cryptanalysis Revisited
• Analog Chaos-based Secure Communications and Cryptanalysis: A Brief Survey
• Cryptanalysis of a computer cryptography scheme based on a filter bank
• Security problems with a SC-CNN-based Chaotic Masking Secure Communication System
• A New Lorenz System Parameter Determination Method and Applications