2,022 research outputs found
Applications of tripled chaotic maps in cryptography
Security of information has become a major issue during the last decades. New
algorithms based on chaotic maps were suggested for protection of different
types of multimedia data, especially digital images and videos in this period.
However, many of them fundamentally were flawed by a lack of robustness and
security. For getting higher security and higher complexity, in the current
paper, we introduce a new kind of symmetric key block cipher algorithm that is
based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two
coupling parameters, as well as the increased complexity of the cryptosystem,
make a contribution to the development of cryptosystem with higher security. In
order to increase the security of the proposed algorithm, the size of key space
and the computational complexity of the coupling parameters should be increased
as well. Both the theoretical and experimental results state that the proposed
algorithm has many capabilities such as acceptable speed and complexity in the
algorithm due to the existence of two coupling parameter and high security.
Note that the ciphertext has a flat distribution and has the same size as the
plaintext. Therefore, it is suitable for practical use in secure
communications.Comment: 21 pages, 10 figure
Image data hiding
Image data hiding represents a class of processes used to embed data into cover images.
Robustness is one of the basic requirements for image data hiding. In the first part of this dissertation, 2D and 3D interleaving techniques associated with error-correction-code (ECC) are proposed to significantly improve the robustness of hidden data against burst errors.
In most cases, the cover image cannot be inverted back to the original image after the hidden data are retrieved. In this dissertation, one novel reversible (lossless) data hiding technique is then introduced. This technique is based on the histogram modification, which can embed a large amount of data while keeping a very high visual quality for all images. The performance is hence better than most existing reversible data hiding algorithms.
However, most of the existing lossless data hiding algorithms are fragile in the sense that the hidden data cannot be extracted correctly after compression or small alteration. In the last part of this dissertation, we then propose a novel robust lossless data hiding technique based on patchwork idea and spatial domain pixel modification. This technique does not generate annoying salt-pepper noise at all, which is unavoidable in the other existing robust lossless data hiding algorithm. This technique has been successfully applied to many commonly used images, thus demonstrating its generality
Analysis and Design Security Primitives Based on Chaotic Systems for eCommerce
Security is considered the most important requirement for the success of electronic commerce, which is built based on the security of hash functions, encryption algorithms and pseudorandom number generators. Chaotic systems and security algorithms have similar properties including sensitivity to any change or changes in the initial parameters, unpredictability, deterministic nature and random-like behaviour. Several security algorithms based on chaotic systems have been proposed; unfortunately some of them were found to be insecure and/or slow.
In view of this, designing new secure and fast security algorithms based on chaotic systems which guarantee integrity, authentication and confidentiality is essential for electronic commerce development. In this thesis, we comprehensively explore the analysis and design of security primitives based on chaotic systems for electronic commerce: hash functions, encryption algorithms and pseudorandom number generators. Novel hash functions, encryption algorithms and pseudorandom number generators based on chaotic systems for electronic commerce are proposed. The securities of the proposed algorithms are analyzed based on some well-know statistical tests in this filed. In addition, a new one-dimensional triangle-chaotic map (TCM) with perfect chaotic behaviour is presented.
We have compared the proposed chaos-based hash functions, block cipher and pseudorandom number generator with well-know algorithms. The comparison results show that the proposed algorithms are better than some other existing algorithms. Several analyses and computer simulations are performed on the proposed algorithms to verify their characteristics, confirming that these proposed algorithms satisfy the characteristics and conditions of security algorithms. The proposed algorithms in this thesis are high-potential for adoption in e-commerce applications and protocols
New Watermarking/Encryption Method for Medical Imaging FULL Protection in m-Health
In this paper, we present a new method for medical images security dedicated to m-Health based on a combination between a novel semi reversible watermarking approach robust to JPEG compression, a new proposed fragile watermarking and a new proposed encryption algorithm. The purpose of the combination of these three proposed algorithms (encryption, robust and fragile watermarking) is to ensure the full protection of medical image, its information and its report in terms of confidentiality and reliability (authentication and integrity). A hardware implementation to evaluate our system is done using the Texas instrument C6416 DSK card by converting m-files to C/C++ using MATLAB coder. Our m-health security system is then run on the android platform. Experimental results show that the proposed algorithm can achieve high security with good performance
- …