Cryptanalysis of chaotic communication schemes by dynamical minimization algorithm
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 2429-2437 |
| Journal / Publication | International Journal of Bifurcation and Chaos |
| Volume | 19 |
| Issue number | 7 |
| Publication status | Published - Jul 2009 |
Link(s)
Abstract
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
Citation Format(s)
Cryptanalysis of chaotic communication schemes by dynamical minimization algorithm. / Liu, Ying; Mao, Yu; Tang, Wallace K. S. et al.
In: International Journal of Bifurcation and Chaos, Vol. 19, No. 7, 07.2009, p. 2429-2437.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
