2010 International Conference on Communications, Circuits and Systems (ICCCAS) 2010
DOI: 10.1109/icccas.2010.5581874
|View full text |Cite
|
Sign up to set email alerts
|

Generalized synchronization of non-autonomously discrete time chaotic system

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2015
2015

Publication Types

Select...
1
1

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…Theorem 2: ( [21]) Let X, Y, X , (X, ) and (Y, X, ) and be defined by Theorem 1, and = ( , ) ∈ ℝ × such the spectrum of : ( ) < 1 then following two systems are in GS with respect to the transformation : …”
Section: Definition and Gs Theoremsmentioning
confidence: 99%
“…Theorem 2: ( [21]) Let X, Y, X , (X, ) and (Y, X, ) and be defined by Theorem 1, and = ( , ) ∈ ℝ × such the spectrum of : ( ) < 1 then following two systems are in GS with respect to the transformation : …”
Section: Definition and Gs Theoremsmentioning
confidence: 99%
“…, +1000 } . (38) (3) Drop the first 1000 iterative values, use the formula (33) and (34) to encrypt the plaintext stream , and then obtain a ciphertext…”
Section: Mathematical Problems In Engineeringmentioning
confidence: 99%
“…This paper extends the concept of the generalized synchronization [38] to generalized stability (GST) for discretetime nonautonomous chaos system (DNCS), and then we propose a corresponding GST theorem. Using the GST theorem helps design a novel nonautonomous chaotic discrete system and construct a chaos-based pseudorandom number generator (CPRNG).…”
Section: Introductionmentioning
confidence: 99%