Synchronization of high-order oscillators by observer design with application to hyperchaos-based cryptography

Grassi, Giuseppe; Mascolo, Saverio

doi:10.1002/(sici)1097-007x(199911/12)27:6<543::aid-cta81>3.0.co;2-4

Cited by 20 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 1(b) shows the trajectory of constructed driven system (7). Figure 1(c) shows the trajectory of H(x(n)).…”

Section: Tdgs Theorems For Time-delayed Discrete Systemsmentioning

confidence: 99%

Generalized Synchronization of Time-Delayed Discrete Systems

Jian-Yi¹,

Lee²

2009

Commun. Theor. Phys.

View full text Add to dashboard Cite

This paper establishes two theorems for two time-delayed (chaotic) discrete systems to achieve timedelayed generalized synchronization (TDGS). These two theorems uncover the general forms of two TDGS systems via a prescribed transformation. As examples, we convert the Lorenz three-dimensional chaotic map to an equal time-delayed system as the driving system, and construct the TDGS driven systems according to the Theorems 1 and 2. Numerical simulations demonstrate the effectiveness of the proposed theorems.

show abstract

“…Figure 1(b) shows the trajectory of constructed driven system (7). Figure 1(c) shows the trajectory of H(x(n)).…”

Section: Tdgs Theorems For Time-delayed Discrete Systemsmentioning

confidence: 99%

Generalized Synchronization of Time-Delayed Discrete Systems

Jian-Yi¹,

Lee²

2009

Commun. Theor. Phys.

View full text Add to dashboard Cite

show abstract

“…• Remark. Since each time Alice uses different initial condition X(l) to generate chaos stream, the pseudo-randomness of chaos trajectories of systems (1), (7) can guarantee the pseudo randomness of the key stream Y k.…”

Section: Data Encryption Schemementioning

confidence: 99%

Partial generalized synchronization theorem of discrete systems with applications in encryption scheme

Jian-Yi

Lee

Zhao

2007

2007 International Conference on Communications, Circuits and Systems

View full text Add to dashboard Cite

This paper presents a theorem for designing con troller to make two independent (chaotic) discrete systems realize directional partial generalized synchronization (pGS). A non symmetric encryption scheme is introduced based on the theorem.One numerical simulation example is given to illustrate the effectiveness of the proposed theorem and the encryption scheme.The scheme is able successfully to encrypt and decrypt original information without any loss. The analysis of the key space, sensitivity of key parameters show that this scheme has sound security. The key space of the encryption scheme is larger than 1068• It can be expected that our theorem and encryption scheme provide new tools for understanding and studying PGS phenomena and information encryptions.

show abstract

“…Three general countermeasures have been proposed in the literature: 1) using more complex dynamical systems, such as high-dimensional hyperchaotic systems or multiple cascaded (heterogeneous) chaotic systems [Grassi & Mascolo, 1999a;Murali, 2000;Yao et al, 2003]; 2) introducing traditional ciphers into the chaotic cryptosystems Grassi & Mascolo, 1999b;Lian et al, 2003]; 3) introducing an impulsive (also named sporadic) driving signal instead of the continuous signal to realize synchronization He et al, 2000;Khadra et al, 2003]. The first countermeasure has been found insecure against some attacks [Short & Parker, 1998;Zhou & Lai, 1999;Huang et al, 2001;Tao et al, 2003], and some security defects of the second countermeasure have also been reported [Parker & Short, 2001], but the last one has not yet been cryptanalyzed to date.…”

Section: Introductionmentioning

confidence: 99%

Return-Map Cryptanalysis Revisited

Chen

Álvarez

2006

Int. J. Bifurcation Chaos

View full text Add to dashboard Cite

As a powerful cryptanalysis tool, the scheme of return-map attack can be used to extract secret messages masked by chaos in secure communication schemes. Recently, a simple defensive mechanism was presented to enhance the security of chaotic parameter modulation schemes against return-map attacks. Two techniques are combined in the proposed defensive mechanism: multistep parameter modulation and alternative driving of two different transmitter variables. This paper re-studies the security of this proposed defensive mechanism against return-map attacks, and points out that the security was much over-estimated by the authors for both ciphertext-only attack and known/chosen-plaintext attacks. It is found that a deterministic relationship exists between the shape of the return map and the modulated parameter, and that such a relationship can be used to dramatically enhance the return-map attack thereby making it easy to break the proposed mechanism.

show abstract

Synchronization of high-order oscillators by observer design with application to hyperchaos-based cryptography

Cited by 20 publications

References 17 publications

Generalized Synchronization of Time-Delayed Discrete Systems

Generalized Synchronization of Time-Delayed Discrete Systems

Partial generalized synchronization theorem of discrete systems with applications in encryption scheme

Return-Map Cryptanalysis Revisited

Contact Info

Product

Resources

About