Search

A symmetric key image cryptosystem based on the piecewise linear map is presented in this paper. In this cryptosystem, the encryption process and the decryption process are exactly same. They both include the same operations of plaintext-related scrambling once, diffusion twice and matrix rotating of 180 degrees four times. The length of secret key in the system is 64d where d is a positive integer. The proposed system can fight against the chosen/known plaintext attacks due to the using of plaintext-related scrambling. The simulate results and comparison analysis show that the proposed system has many merits such as high encryption/decryption speed, large key space, strong key sensitivity, strong plaintext sensitivity, strong cipher-text sensitivity, good statistical properties of cipher images, and large cipher-text information entropy. So the proposed system can be applied to actual communications.

We propose a novel color image encryption scheme based on DNA permutations. In the proposed scheme, the chaotic pseudo-random sequences for encryption depend on the plaintext image and secret keys. Besides, the proposed DNA permutation and addition/subtraction operations can break the bit planes of the plaintext image entirely. Therefore, the proposed scheme is sensitive to the plaintext image and can resist common attacks such as differential attack, brute-force attack, and statistical attack. Simulation results show the feasibility and effectiveness of the proposed scheme.

Recently, an image encryption algorithm based on hyper-chaotic system and dynamic S-box has been proposed by Liu et al. The main idea of the encryption algorithm is utilizing key-streams generated by hyper-chaotic system to permute and substitute plain-image pixels. In this paper, we analyze the potential security problems of the encryption algorithm in detail and propose a chosen-plaintext attack to break the encryption algorithm. The proposed chosen-plaintext attack indicates that the encryption scheme is insecure and not suitable for image secure communication. Based on the result of cryptanalysis, an improved algorithm is proposed to eliminate the potential security problem in Liu’s algorithm. Experimental results show that improved algorithm not only inherits the merits of the original scheme, but also has better cryptographic performances in statistical characteristics, plaintext sensitivity and key sensitivity.

In recent years, a wide variety of cryptographic algorithms based on chaos have been put forward and most of them have been proved to be successful by adopting the traditional permutation-diffusion architecture. However, one drawback these methods mostly hold is that they have little connection with the plaintext or, properly speaking, the relationship between them is rather less. The drawback makes the encryption algorithms vulnerable to the known-plaintext and chosen-plaintext attack. In addition, the secret keys are stationary at most times, and they can't be selected dynamically by the corresponding plain image pixels. In order to overcome these disadvantages mentioned above, we introduce a new chaos-based image encryption algorithm with dynamic key selection mechanisms in this paper, and present a dynamic keystream sequence group selection mechanism (DKSGSM) and a dynamic keystream selection mechanism (DKSM). They strongly enhance the relationship between the plaintext and the encryption scheme. In particular, the DKSGSM and DKSM expand the selection range of the keys and allow us to select the keys dynamically by the corresponding plaintext pixels. What's more, by adopting the bidirectional encryption, we can spread the influence to the whole image once a tiny change in plain image and this can greatly increase the security level of our encryption method. Simulation results and numerical analyses indicate that our encryption scheme is safe and efficient.

Due to the interesting nonlinear dynamic properties of chaotic maps, recently chaos-based encryption algorithms have gained much attention in cryptographic communities. However, many encryption schemes do not fulfil the minimum key space requirement, which is an essential concern in many secure data applications. In this paper, an efficient chaos-based image encryption scheme with higher key space is presented. Even with a single round of encryption, a significantly larger key space can be achieved. The proposed scheme removes correlation among image pixels via random chaotic sequences, simply by XOR and addition operations. In order to resist against numerous attacks, we apply the affine transformation to get the final ciphertext image. The security of the proposed scheme is proved through histogram, contrast, PSNR, entropy, correlation, key space, key sensitivity and differential attack analysis. Many significant properties of chaotic maps, sensitivity to initial condition and control parameters, structure and attack complexity, make the anticipated scheme very reliable, practical and robust in various secure communication applications.

Recently, a block cryptosystem based on iterating a chaotic map is analyzed and improved. But still four security flaws in this improved cryptosystem have been identified with careful analysis. First, the first block of ciphertext is identical to the corresponding plaintext in special circumstances. Second, an important parameter can be obtained with a chosen ciphertext attack. Third, with this parameter, a known block of ciphertext, and the corresponding block of plaintext, a block of plaintext can be recovered by chosen ciphertext attack. Forth, the relationship between every two blocks of the keystream can be determined, leading to the recovery of the entire keystream if a single block of the keystream can be obtained. Those four security flaws render the cryptosystem insecure for general use.

In this paper, we propose to cryptanalyse an encryption algorithm which combines a DNA addition and a chaotic map to encrypt a gray scale image. Our contribution consists on, at first, demonstrating that the algorithm, as it is described, is non-invertible, which means that the receiver cannot decrypt the ciphered image even if he posses the secret key. Then, a chosen plaintext attack on the invertible encryption block is described, where, the attacker can illegally decrypt the ciphered image by a temporary access to the encryption machinery.

Real-time video streams require an efficient encryption method to ensure their confidentiality. One of the major challenges in designing a video encryption algorithm is to encrypt the vast amount of video data in real-time to satisfy the stringent time requirements. Video encryption algorithms can be classified according to their association with video compression into joint compression and encryption algorithms and compression-independent encryption algorithms. The latter have a clear advantage over the former regarding the incorporation into existing multimedia systems due to their independence of the video compression. In this paper we present the compression-independent video encryption algorithm Puzzle, which was inspired by the children game jigsaw puzzle. It comprises two simple encryption operations with low computational complexity: puzzling and obscuring. The scheme thereby dramatically reduces the encryption overhead compared to conventional encryption algorithms, such as AES, especially for high resolution video. Further outstanding features of Puzzle are a good trade-off between security demands and encryption efficiency, no impairment on video compression efficiency, and an easy integration into existing multimedia systems. This makes Puzzle particularly well-suited for these security-sensitive multimedia applications, such as videoconferencing, where maximal security and minimal encryption overhead are desired simultaneously.

Joint watermarking and encryption is an upcoming security solution that combines leading but complementary techniques to achieve an enhanced security level. Real time applications using joint watermarking and encryption framework has three requirements: data to be efficiently compressed, watermarking technique to sustain compression, and encryption technique to be developed in a way so as not to disturb the compression efficiency. Finding an optimal solution that combines the three techniques while fulfilling these requirements is a challenging problem. This paper thus, proposes a wavelet domain based joint watermarking and encryption framework that employs singular value decomposition based watermark embedding and sign bit encryption prior to compression. The varying significance of different subbands has been considered to encrypt the data without adversely effecting the compression ratio. Experimental analysis using various evaluation parameters and attack scenarios has revealed the ability of the proposed framework to prove content-ownership, even from the encrypted data. Comparative analysis with the existing techniques reflect its ability to provide better security with less computational resources. This makes it a preferable solution for data security at all stages of data archival, transmission or distribution.

Encryption is one of the fundamental technologies that is used in the security of multimedia data. Unlike ordinary computer applications, multimedia applications generate large amount of data that has to be processed in real time. This work investigates the problem of efficient multimedia data encryption. A scheme known as the Randomized Huffman Table scheme was recently proposed to achieve encryption along with compression. Though this scheme has several advantages it cannot overcome the chosen plaintext attack. An enhancement of this Huffman scheme is proposed in this work which essentially overcomes the attack and improves the security. The proposed encryption approach consists of two modules. The first module is the Randomized Huffman Table module, the output of which is fed to the second XOR module to enhance the performance. Security analysis shows that the proposed scheme can withstand the chosen plaintext attack. The efficiency and security of the proposed scheme makes it an ideal choice for real time secure multimedia applications.