Cryptanalysis of chaotic communication schemes by dynamical minimization algorithm

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

3 Scopus Citations
View graph of relations


Related Research Unit(s)


Original languageEnglish
Pages (from-to)2429-2437
Journal / PublicationInternational Journal of Bifurcation and Chaos
Issue number7
Publication statusPublished - Jul 2009


This paper addresses the cryptanalysis of three chaos-based secure communication schemes recently proposed by Yu et al. [2007]. Attacks with adaptive observers designed by the dynamical minimization algorithm are assumed. Considering Kerckhoff's principle, i.e. assuming that the basic structure of a cryptosystem is known but some user-specified parameters remain in secret, it is demonstrated that the covered messages in all these schemes can be estimated and hence their securities are challenged. © 2009 World Scientific Publishing Company.

Research Area(s)

  • Adaptive observer, Adaptive synchronization, Cryptanalysis, Minimization algorithm, Secure communication