4,508 research outputs found
Secure Communication using Compound Signal from Generalized Synchronizable Chaotic Systems
By considering generalized synchronizable chaotic systems, the
drive-auxiliary system variables are combined suitably using encryption key
functions to obtain a compound chaotic signal. An appropriate feedback loop is
constructed in the response-auxiliary system to achieve synchronization among
the variables of the drive-auxiliary and response-auxiliary systems. We apply
this approach to transmit analog and digital information signals in which the
quality of the recovered signal is higher and the encoding is more secure.Comment: 7 pages (7 figures) RevTeX, Please e-mail Lakshmanan for figures,
submitted to Phys. Lett. A (E-mail: [email protected]
Breaking a chaos-based secure communication scheme designed by an improved modulation method
Recently Bu and Wang [Chaos, Solitons & Fractals 19 (2004) 919] proposed a
simple modulation method aiming to improve the security of chaos-based secure
communications against return-map-based attacks. Soon this modulation method
was independently cryptanalyzed by Chee et al. [Chaos, Solitons & Fractals 21
(2004) 1129], Wu et al. [Chaos, Solitons & Fractals 22 (2004) 367], and
\'{A}lvarez et al. [Chaos, Solitons & Fractals, accepted (2004),
arXiv:nlin.CD/0406065] via different attacks. As an enhancement to the Bu-Wang
method, an improving scheme was suggested by Wu et al. by removing the
relationship between the modulating function and the zero-points. The present
paper points out that the improved scheme proposed by Wu et al. is still
insecure against a new attack. Compared with the existing attacks, the proposed
attack is more powerful and can also break the original Bu-Wang scheme.
Furthermore, it is pointed out that the security of the modulation-based
schemes is not so satisfactory from a pure cryptographical point of view. The
synchronization performance of this class of modulation-based schemes is also
discussed.Comment: elsart.cls, 18 pages, 9 figure
Design of nonlinear observer for chaotic message transmission
Thesis (Master)--Izmir Institute of Technology, Electronics and Communication Engineering, Izmir, 2013Includes bibliographical references (leaves: 60-64)Text in English; Abstract: Turkish and Englishx, 64 leavesChaos is an interesting nonlinear phenomena that occurs in wide variety of fields. A significant amount of research was devoted to understanding chaos and its properties. After that, researchers focused on searching for possible application areas for chaos to utilize its properties. The need to increase the security of a communication system is considered as a perfect match for chaos and its several properties, yielding chaotic communication. In this thesis, chaotic communication is approached from a control theory perspective. Specifically, three nonlinear observers are designed to extract message encrypted in a chaotic communication signal. The design and stability analysis is presented for the first observer, and the other observers are presented as modifications to the first one. Extensive numerical simulations are performed to demonstrate the viability of the proposed observers. Robustness of the observers to noise, additive disturbances, and parametric mismatch, and security of the observers are demonstrated numerically
Design considerations for integrated continuous-time chaotic oscillators
This paper presents an optimization procedure to choose the chaotic state equation which is best suited for implementation using Gm-C integrated circuit techniques. The paper also presents an analysis of the most significant hardware nonidealities of Gm-C circuits on the chaotic operation-the basis to design robust integrated circuits with reproducible and easily controllable behavior. The techniques in the paper are illustrated through a circuit fabricated in 2.4-/iin double-poly technology.Comisión Interministerial de Ciencia y Tecnología TIC 96-1392-CO2-
A Novel Latin Square Image Cipher
In this paper, we introduce a symmetric-key Latin square image cipher (LSIC)
for grayscale and color images. Our contributions to the image encryption
community include 1) we develop new Latin square image encryption primitives
including Latin Square Whitening, Latin Square S-box and Latin Square P-box ;
2) we provide a new way of integrating probabilistic encryption in image
encryption by embedding random noise in the least significant image bit-plane;
and 3) we construct LSIC with these Latin square image encryption primitives
all on one keyed Latin square in a new loom-like substitution-permutation
network. Consequently, the proposed LSIC achieve many desired properties of a
secure cipher including a large key space, high key sensitivities, uniformly
distributed ciphertext, excellent confusion and diffusion properties,
semantically secure, and robustness against channel noise. Theoretical analysis
show that the LSIC has good resistance to many attack models including
brute-force attacks, ciphertext-only attacks, known-plaintext attacks and
chosen-plaintext attacks. Experimental analysis under extensive simulation
results using the complete USC-SIPI Miscellaneous image dataset demonstrate
that LSIC outperforms or reach state of the art suggested by many peer
algorithms. All these analysis and results demonstrate that the LSIC is very
suitable for digital image encryption. Finally, we open source the LSIC MATLAB
code under webpage https://sites.google.com/site/tuftsyuewu/source-code.Comment: 26 pages, 17 figures, and 7 table
- …