18,320 research outputs found
Implementation of a secure digital chaotic communication scheme on a DSP board
In this paper, a new a secure communication scheme using chaotic signal for transmitting binary digital signals is proposed and which is then implemented on a Digital Signal Processor (DSP) board. The method uses the idea of indirect coupled synchronization for generating the same keystream in the transmitter and receiver side. This chaotic keystream is applied to encrypt the message signal before being modulated with a chaotic carrier generated from the transmitter. Discrete chaotic maps, 3D Henon map and Lorenz system are used as transmitter/receiver and key generators respectively. The overall system is experimentally implemented in the TMS320C6713 DSK board using code composer and Simulink showing the successful message extraction thus proving the feasibility of the system in the DSP board
Discrete-time synchronization of chaotic systems for secure communication
This paper deals with the problem of designing an exact nonlinear reconstructor for discrete-time chaotic encrypted messages. More precisely, we investigate the problem of designing a discrete-time dead-beat observer for nonlinear systems with unknown inputs. The application of the proposed observer in the context of secure communication and data transmission is also investigated
Return-Map Cryptanalysis Revisited
As a powerful cryptanalysis tool, the method of return-map attacks can be
used to extract secret messages masked by chaos in secure communication
schemes. Recently, a simple defensive mechanism was presented to enhance the
security of chaotic parameter modulation schemes against return-map attacks.
Two techniques are combined in the proposed defensive mechanism: multistep
parameter modulation and alternative driving of two different transmitter
variables. This paper re-studies the security of this proposed defensive
mechanism against return-map attacks, and points out that the security was much
over-estimated in the original publication for both ciphertext-only attack and
known/chosen-plaintext attacks. It is found that a deterministic relationship
exists between the shape of the return map and the modulated parameter, and
that such a relationship can be used to dramatically enhance return-map attacks
thereby making them quite easy to break the defensive mechanism.Comment: 11 pages, 7 figure
Security analysis of communication system based on the synchronization of different order chaotic systems
This work analyzes the security weakness of a recently proposed communication
method based on chaotic modulation and masking using synchronization of two
chaotic systems with different orders. It is shown that its application to
secure communication is unsafe, because it can be broken in two different ways,
by high-pass filtering and by reduced order system synchronization, without
knowing neither the system parameter values nor the system key.Comment: 12 pages, 6 figures, LaTeX forma
Cryptanalyzing a discrete-time chaos synchronization secure communication system
This paper describes the security weakness of a recently proposed secure
communication method based on discrete-time chaos synchronization. We show that
the security is compromised even without precise knowledge of the chaotic
system used. We also make many suggestions to improve its security in future
versions.Comment: 11 pages, 3 figures, latex forma
Secure covert communications over streaming media using dynamic steganography
Streaming technologies such as VoIP are widely embedded into commercial and industrial applications, so it is imperative to address data security issues before the problems get really serious. This thesis describes a theoretical and experimental investigation of secure covert communications over streaming media using dynamic steganography. A covert VoIP communications system was developed in C++ to enable the implementation of the work being carried out.
A new information theoretical model of secure covert communications over streaming media was constructed to depict the security scenarios in streaming media-based steganographic systems with passive attacks. The model involves a stochastic process that models an information source for covert VoIP communications and the theory of hypothesis testing that analyses the adversaryâs detection performance.
The potential of hardware-based true random key generation and chaotic interval selection for innovative applications in covert VoIP communications was explored. Using the read time stamp counter of CPU as an entropy source was designed to generate true random numbers as secret keys for streaming media steganography. A novel interval selection algorithm was devised to choose randomly data embedding locations in VoIP streams using random sequences generated from achaotic process.
A dynamic key updating and transmission based steganographic algorithm that includes a one-way cryptographical accumulator integrated into dynamic key exchange for covert VoIP communications, was devised to provide secure key exchange for covert communications over streaming media. The discrete logarithm problem in mathematics and steganalysis using t-test revealed the algorithm has the advantage of being the most solid method of key distribution over a public channel.
The effectiveness of the new steganographic algorithm for covert communications over streaming media was examined by means of security analysis, steganalysis using non parameter Mann-Whitney-Wilcoxon statistical testing, and performance and robustness measurements. The algorithm achieved the average data embedding rate of 800 bps, comparable to other related algorithms. The results indicated that the algorithm has no or little impact on real-time VoIP communications in terms of speech quality (< 5% change in PESQ with hidden data), signal distortion (6% change in SNR after steganography) and imperceptibility, and it is more secure and effective in addressing the security problems than other related algorithms
Breaking a chaos-noise-based secure communication scheme
This paper studies the security of a secure communication scheme based on two
discrete-time intermittently-chaotic systems synchronized via a common random
driving signal. Some security defects of the scheme are revealed: 1) the key
space can be remarkably reduced; 2) the decryption is insensitive to the
mismatch of the secret key; 3) the key-generation process is insecure against
known/chosen-plaintext attacks. The first two defects mean that the scheme is
not secure enough against brute-force attacks, and the third one means that an
attacker can easily break the cryptosystem by approximately estimating the
secret key once he has a chance to access a fragment of the generated
keystream. Yet it remains to be clarified if intermittent chaos could be used
for designing secure chaotic cryptosystems.Comment: RevTeX4, 11 pages, 15 figure
Cryptographic requirements for chaotic secure communications
In recent years, a great amount of secure communications systems based on
chaotic synchronization have been published. Most of the proposed schemes fail
to explain a number of features of fundamental importance to all cryptosystems,
such as key definition, characterization, and generation. As a consequence, the
proposed ciphers are difficult to realize in practice with a reasonable degree
of security. Likewise, they are seldom accompanied by a security analysis.
Thus, it is hard for the reader to have a hint about their security. In this
work we provide a set of guidelines that every new cryptosystems would benefit
from adhering to. The proposed guidelines address these two main gaps, i.e.,
correct key management and security analysis, to help new cryptosystems be
presented in a more rigorous cryptographic way. Also some recommendations are
offered regarding some practical aspects of communications, such as channel
noise, limited bandwith, and attenuation.Comment: 13 pages, 3 figure
- âŚ