Chaos shift keying: modulation and demodulation of a chaotic carrier using self-synchronizing Chua's circuits

Dedieu, H.; Kennedy, Michael Peter; Hasler, M.

doi:10.1109/82.246164

Cited by 745 publications

(338 citation statements)

References 11 publications

Supporting

Mentioning

331

Contrasting

Unclassified

Order By: Relevance

“…Chaotic switching is also referred to as chaos shift keying (CSK). A description with deep insights can be found in [61], even though the idea of CSK was proposed a couple of years before [38]. Essentially, chaotic switching is a special type of chaotic parameter modulation: binary modulation.…”

Section: Main Problems In Chaos-based Cryptographymentioning

confidence: 99%

“…Essentially, chaotic switching is a special type of chaotic parameter modulation: binary modulation. As a generalization of chaotic switching, the parameter involved in a parameter modulation system can be both discrete [89,38] or continuous [42,51], rather than only 0 or 1 in chaotic switching. The message-embedding technique is given different names in the literature: embedding [72,82], non autonomous modulation [112] or direct chaotic modulation [47].…”

Section: Main Problems In Chaos-based Cryptographymentioning

confidence: 99%

See 1 more Smart Citation

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Álvarez

Amigó

Arroyo

et al. 2011

Studies in Computational Intelligence

View full text Add to dashboard Cite

The idea of using chaotic transformations in cryptography is explicit in the foundational papers of Shannon on secrecy systems (e.g., [96]). Although the word "chaos" was not minted till the 1970s [71], Shannon clearly refers to this very concept when he proposes the construction of secure ciphers by means of measure-preserving, mixing maps which depend 'sensitively' on their parameters. The implementation of Shannon's intuitions had to wait till the development of Chaos Theory in the 1980s. Indeed, it was around 1990 when the first chaos-based ciphers were proposed (e.g., [78], [46]). Moreover, in 1990 chaos synchronization [91] entered the scene and shortly thereafter, the first applications to secure communications followed [56,37]. The idea is remarkably simple: mask the message with a chaotic signal and use synchronization at the receiver to filter out the chaotic signal. The realization though had to overcome the desynchronization induced by the message itself. After this initial stage, the number of proposals which exploited the properties of chaotic maps for cryptographical purposes, grew in a spectacular way.

show abstract

Section: Main Problems In Chaos-based Cryptographymentioning

confidence: 99%

Section: Main Problems In Chaos-based Cryptographymentioning

confidence: 99%

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Álvarez

Amigó

Arroyo

et al. 2011

Studies in Computational Intelligence

View full text Add to dashboard Cite

show abstract

“…A wide overview of the general area can be obtained from the monographs [9], [15], [23], [14] and [27], although not yet reaching work in laser optics [28], [2]. The paper focuses on the multi-user chaos shift-keying system of communication with chaotic map spreading, emerging from [6], [11], [12] and [24]. The main concern here is the theory and computation of bit error rate (BER), the primary measure of performance for many types of system.…”

Section: Introductionmentioning

confidence: 99%

Chaos Communication Performance: Theory and Computation

Kaddoum

Lawrance

Chargé³

et al. 2010

Circuits Syst Signal Process

View full text Add to dashboard Cite

In this paper new and existing approaches are developed to compute the bit error rate for chaos-based communication systems. The multi-user coherent antipodal chaos shift keying system is studied and evaluated in its coherent form, in the sense of perfect synchronization between transmitted and received chaotic sequences. Transmission is through an additive white Gaussian noise channel. Four methods are interrelated in the paper, three approximate ones and an exact one. The least accurate but most well known is based on simple Gaussian approximation; this is generalized to better reveal its structure. Two accurate and computationally efficient approximate methods are based on conditional Gaussian approximation and the statistical distribution of the typically non-constant bit energy. The most insightful but computationally expensive one is based on exact theory and rests on explicit mathematical results for particular chaotic maps used to spread binary messages. Both upper and lower bounds to the bit error rate are suggested. The relative advantages of the different approaches are illustrated with plots of bit error rate against signal to noise ratio.

show abstract

“…[1][2][3][4][5] Depending upon the type of coupling and parameter mismatched between the interacting systems, several types of synchronization have been found such as, complete synchronization (CS), 6 generalized synchronization (GS), 7 phase synchronization (PS), 8 generalized projective synchronization (GPS), 9 lag synchronization (LS), 10 multiplexing synchronization (MS) 11 etc. CS appear only when interacting systems are identical.…”

Section: Introductionmentioning

confidence: 99%

Generalized synchronization-based multiparameter estimation in modulated time-delayed systems

Ghosh¹,

Bhattacharyya

2011

AIP Advances

View full text Add to dashboard Cite

We propose a nonlinear active observer based generalized synchronization scheme for multiparameter estimation in time-delayed systems with periodic time delay. A sufficient condition for parameter estimation is derived using Krasovskii-Lyapunov theory. The suggested tool proves to be globally and asymptotically stable by means of Krasovskii-Lyapunov method. With this effective method, parameter identification and generalized synchronization of modulated time-delayed systems with all the system parameters unknown, can be achieved simultaneously. We restrict our study for multiple parameter estimation in modulated time-delayed systems with single state variable only. Theoretical proof and numerical simulation demonstrate the effectiveness and feasibility of the proposed technique. The block diagram of electronic circuit for multiple time delay system shows that the method is easily applicable in practical communication problems.

show abstract

Chaos shift keying: modulation and demodulation of a chaotic carrier using self-synchronizing Chua's circuits

Cited by 745 publications

References 11 publications

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Lessons Learnt from the Cryptanalysis of Chaos-Based Ciphers

Chaos Communication Performance: Theory and Computation

Generalized synchronization-based multiparameter estimation in modulated time-delayed systems

Contact Info

Product

Resources

About