Steps towards improving the security of chaotic encryption

Fraser, Blair; Yu, Pei; Lookman, Turab

doi:10.1103/physreve.66.017202

Cited by 14 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It reveals a highly variable and specific DPC language, providing the individual with a large bandwidth communication platform, a situation that has a close resemblance to chaotic communication setups. [16][17][18][19][20][21][22][23][24] Male D, in particular, widely uses this expression space, which indicates that during courtship, more than mere group membership is conveyed. Transferred information might even include behaviorally encoded details on the sender's genetic configuration, as the base for situation-dependent decisions such as the "better mate versus no mate" trade-off.…”

Section: Discussionmentioning

confidence: 99%

Mesocopic comparison of complex networks based on periodic orbits

Stoop

Joller

2011

Chaos: An Interdisciplinary Journal of Nonlinear Science

View full text Add to dashboard Cite

Complex noiseless dynamical systems can be represented in a compressed manner by unstable periodic orbits. It is unknown, however, how to use this technique to obtain a suitable notion of similarity among them, how to extend such an approach to more general complex networks, and how to apply such a method in the important case of noisy systems. Our approach provides a solution to these questions. For a proof-of-concept, we consider Drosophila's precopulatory courtship, where our method reveals the existence of a complex grammar (similar to those found in complex physical systems and in language), leading to the conclusion that the observed grammar is very unlikely the product of chance. Complex noiseless dynamical systems can be represented in a compressed manner by unstable periodic orbits. It is unknown, however, how to use this technique to obtain a suitable notion of similarity among them, how to extend such an approach to more general complex networks, and how to apply such a method in the important case of noisy systems. Our approach provides a solution to these questions. For a proof-of-concept, we consider Drosophila's precopulatory courtship, where our method reveals the existence of a complex grammar (similar to those found in complex physical systems and in language), leading to the conclusion that the observed grammar is very unlikely the product of chance. Complex networks are usually described in terms of abstract network structures, where a node often comes equipped with a rule characterizing its local activity, or by using Markov random walks models. For their understanding, however, intermediate scales may play a distinguished role. This is the case if measures characterizing the network as a whole are too crude for providing the desired insights and if the local node dynamics do not provide an overview of the network. We formulate here in precise mathematical terms such as intermediate, mesoscopic, description of the network, based on periodic orbits as the mesoscopic observables. From these observables, we develop a method for measuring the similarity of graphs, a challenge of great importance that seems not to have been solved in the generality put forward here. An obvious typical application of our approach would be, e.g., the characterization of behavior, with robotics motion planning or the characterization of animal courtship behavior as prominent examples. Animal courtship, which we chose as the real-world testing case of our approach, is a puzzling phenomenon. Its function and purpose have largely remained unexplained, not least because of the generally large and complex underlying network structure and the lack of methods able to deal with such situations. The driving biological questions that we wish to answer here are: Could it be that during courtship, nontrivial information about a prospective mate is conveyed? And if so, how is this information organized and what purpose could it serve? The proposed approach provides partial answers to these questions. We verify that Dro...

show abstract

Section: Discussionmentioning

confidence: 99%

Mesocopic comparison of complex networks based on periodic orbits

Stoop

Joller

2011

Chaos: An Interdisciplinary Journal of Nonlinear Science

View full text Add to dashboard Cite

show abstract

“…I, the basic difference between conventional cryptography and chaos cryptography is that the conventional encryption is defined on discrete sets and the chaos encryption is defined on continuous sets. This makes the keyspace behavior of chaotic systems very different from that of conventional systems [8,15]. Due to its continuous-value property, in chaos encryption systems keys that are not identical but are very close can still be used to synchronize the two systems very well, thus will form a key basin around the actual secret key [7,9,13,15].…”

Section: Error Function Attackmentioning

confidence: 99%

“…This makes the keyspace behavior of chaotic systems very different from that of conventional systems [8,15]. Due to its continuous-value property, in chaos encryption systems keys that are not identical but are very close can still be used to synchronize the two systems very well, thus will form a key basin around the actual secret key [7,9,13,15]. Because of this, Eve will not need to try all the keys in the keyspace; she can, according to the special characters of key basin, find some optimization method to systematically adjust the trial key k ′ untill k ′ = k. By this way, the cryptanalysis time can be greatly reduced.…”

Section: Error Function Attackmentioning

confidence: 99%

“…For chaos based encryption, relatively little attention has been paid to the latter two criteria [1,13,15], which are intimately linked to the attempts to achieve greater security.…”

Section: Quality Factormentioning

confidence: 99%

“…The security of the system is broken as soon as the actual key basin is exposed, since the searching cost of extracting the secret key then once is negligible. This motivates us to define the security of a cryptosystem as the entropy of the key number [15] …”

Section: Quality Factormentioning

confidence: 99%

See 2 more Smart Citations

Error function attack of chaos synchronization based encryption schemes

Wang

Zhan

Lai

et al. 2004

Chaos: An Interdisciplinary Journal of Nonlinear Science

View full text Add to dashboard Cite

Different chaos synchronization based encryption schemes are reviewed and compared from the practical point of view. As an efficient cryptanalysis tool for chaos encryption, a proposal based on the Error Function Attack is presented systematically and used to evaluate system security. We define a quantitative measure (Quality Factor) of the effective applicability of a chaos encryption scheme, which takes into account the security, the encryption speed, and the robustness against channel noise. A comparison is made of several encryption schemes and it is found that a scheme based on one-way coupled chaotic map lattices performs outstandingly well, as judged from Quality Factor.

show abstract