2010
DOI: 10.1016/j.cnsns.2009.09.036
|View full text |Cite
|
Sign up to set email alerts
|

Meta-chaos: Reconstructing chaotic attractors from the separation of nearby initial conditions on hyperhelices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…This algorithm meets the principle of Kerchhoff, and the key belongs to the set of real number, so the key space is large, and it can resist brute-force attack. Although these encryption methods have a super security, the attacker often decrypts the cipher-text by the cryptanalysis method or chaos reconstruction [3][4] [5] [6]. Even if the adversary cannot decrypt the encrypted message, he or she can destroy the cipher-text such that the legal user cannot obtain the plaintext.…”
Section: Introductionmentioning
confidence: 99%
“…This algorithm meets the principle of Kerchhoff, and the key belongs to the set of real number, so the key space is large, and it can resist brute-force attack. Although these encryption methods have a super security, the attacker often decrypts the cipher-text by the cryptanalysis method or chaos reconstruction [3][4] [5] [6]. Even if the adversary cannot decrypt the encrypted message, he or she can destroy the cipher-text such that the legal user cannot obtain the plaintext.…”
Section: Introductionmentioning
confidence: 99%