Permutation-substitution image encryption scheme based on a modified chaotic map in transform domain (original) (raw)

Hybrid Ciphering System of Images based on Fractional Fourier Transform and Two Chaotic Maps

International Journal of Computer Applications, 2015

This paper presents a new implementation of a hybrid ciphering system of images in Fourier domain based on two chaotic maps. The first map is the Bakermap,which is used to scramble the image pixels in three modes of operation (CBC, CFB and OFB). The second map is the logistic map,whose secret key depends on the plain text. In the key generation step of the logistic map, the chaotic stream is generated with plain text and hence the relation between the key and the plain text is established. We use Fractional Fourier Transform (FrFT) before the encryption to achieve a large degree of randomization. We examine the proposed algorithm and compare the results with the RC6 algorithm. The performance and security analysis prove that this hybrid ciphering system is efficient, reliable, and can effectively resist different attacks.

An Image Encryption Approach Using Chaotic Map in Frequency Domain

2012

This paper presents a chaotic map based cryptography technique, in the proposed technique; confusion and diffusion applied on spectral domain (on DCT(Discrete Cosine Transform) coefficients) hence the encryption can be achieved quickly without applying the large number of confusion and diffusion cycle as it is needed in spatial domain. Also the diffusion template is created by random number generator based on Gaussian distribution. The technique uses Bakers map and capable of providing the key length of 128 bits although it’s length can be extended further. The proposed technique is simulated using Matlab and the results prove its robustness with all type of cryptanalytic tests and faster execution.

A Novel Chaotic Permutation-Substitution Image Encryption Scheme Based on Logistic Map and Random Substitution

IEEE Access, 2022

Privacy is a serious concern related to sharing videos or images among people over the Internet. As a method to preserve images' privacy, chaos-based image encryption algorithms have been used widely to fulfil such a requirement. However, these algorithms suffer from a low key-space, significant computational overhead, and a lag in resistance against differential attacks. This paper presents a novel chaos-based image encryption method based on permutation and substitution using a single Substitution Box (S-Box) to address issues in contemporary image encryption algorithms. The proposed encryption technique's efficiency is validated through extensive experiments as compared to the state-of-the-art encryption algorithms using different measures and benchmarks. Precisely, the collected results demonstrate that the proposed technique is more resilient against well-known statistical attacks and performs well under plaintext attacks. Indeed, the proposed scheme exhibits very high sensitivity concerning the plaintext attack. A minor change in the encryption key or the plain text would result in a completely different encrypted image.

Image encryption based on the multiple-parameter discrete fractional Fourier transform and chaos function

Optics Communications, 2010

In recent years, the chaos-based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. In this paper, we propose a new approach for image encryption based on the multiple-parameter discrete fractional Fourier transform and chaotic logistic maps in order to meet the requirements of the secure image transmission. In the proposed image encryption scheme, the image is encrypted by juxtaposition of sections of the image in the multiple-parameter discrete fractional Fourier domains and the alignment of sections is determined by chaotic logistic maps. This method does not require the use of phase keys. The new method has been compared with several existing methods and shows comparable or superior robustness to blind decryption.

A new one-dimensional chaotic map and its application in a novel permutation-less image encryption scheme

The Visual Computer, 2020

In this paper, we propose a new real one-dimensional cosine fractional (1-DCF) chaotic map. Several chaos-theory analysis tests demonstrate that the proposed map has many good cryptography properties, such as a highly chaotic behavior, a large chaotic range, an infinite number of unstable fixed points, and a widely superior sensitivity to the initial conditions than most of the low-dimensional chaotic maps. Regarding these attractive features, we use the 1-DCF map to design a novel fast image encryption scheme for real-time image processing. Unlike most of the existing encryption schemes, we adopt a permutation-less architecture to increase the encryption speed. Regardless of the permutation phase absence, a high-security level is obtained by using a substitution process with a high sensitivity to the plain image. Moreover, we replace the natural row-order encryption with a more secure random-like encryption order generated from the secret key. Experimentation and simulations show that the new scheme is better than many recently proposed encryption schemes in both security and rapidity.

IMAGE ENCRYPTION BASED ON DEVELOPMENT OF HÉNON CHAOTIC MAPS USING FRACTIONAL FOURIER TRANSFORM

In this paper, we propose an image encryption scheme based on the development of a Hénon chaotic map using fractional Fourier transform (FRFT) which is introduced in order to meet the requirements of secure image transfer. This proposed algorithm combines the main advantages of fractional Fourier transform domain (FRFT), chaotic Arnold cat map encryption algorithm for confusion and our proposed Hénon chaotic map for diffusion.

A new secure and sensitive image encryption scheme based on new substitution with chaotic function

Multimedia Tools and Applications, 2014

In this paper, a new image encryption scheme is proposed with high sensitivity to the plain image. In proposed scheme, two chaotic functions and logical operator xor are used. Image encryption process includes substitution of pixels and permutation. Using the new method of substitution, algorithm sensitivity somewhat has elevated to changes in the plain image that by changing a single pixel of the plain image, amount of NPCR reaches 100 %. Results of tests show that the cipher image does not give any information of statistical such as entropy, histogram and correlation of adjacent pixels to attackers. Also the proposed scheme has the wide key space and is so safe to the noise ratio and compression.

Enhanced chaotic image encryption algorithm based on Baker's map

2003

Imaging has gained importance due to the improvements of performances in computer speed, media storage and network bandwidth. Along with this advancement, the fundamental issue of image security has become a major concern and because of this reason, research in image confidentiality has gained popularity amongst security experts. This paper discusses an alternative chaotic image encryption based on Baker's map. This enhanced symmetric-key algorithm can support a variable-size image as opposed to the algorithm which is mainly based on Baker's map that requires only square image for encryption. In addition, the algorithm also includes other functions such as password binding and pixel shifting to further strengthen the security of the cipher image. The algorithm also supports two modes of operation namely EBC and CBC. The number of iterations to be performed can vary depending on the security level required by the user. The paper also includes an example of image encryption. From the analysis done, it shows that the security level is high even though keys that are found to be weak keys for Baker's map algorithm are being used in the algorithm.

Image Encryption Based on Permutation and Substitution Using Clifford Chaotic System and Logistic Map

Journal of Computers, 2018

Chaos theory is a field of study in mathematics that studies the behavior of dynamical systems that are highly sensitive to initial conditions. Many algorithms have been proposed for image encryption, but the chaotic encryption methods have a good combination of speed and high security. The key space for a good encryption scheme should be big enough to resist brute-force attacks. In this paper, first we investigate Clifford chaotic system for image encryption. In order to optimize the encryption system we increase the space key by using logistic map. The security and performance of the proposed method are analyzed by using the key space, entropy, statistical, differential and performance analysis. It can be concluded that the proposed image encryption system is suitable choice for practical applications.

Short Paper: Enhanced 1-D Chaotic Key-Based Algorithm for Image Encryption

First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05), 2005

In the past few years, a number of image encryption algorithms based on chaotic maps have been proposed. A recently proposed Chaotic-Key Based Algorithm (CKBA) is based on a one-dimensional Logistic map. However, it has been shown that the current CKBA model is unavoidably susceptible to chosen/known-plaintext attacks, and that the high security claims against ciphertext-only attack were overestimated by the authors. In addition, the chaotic Logistic map yields unbalanced output. In this paper we enhance the CKBA algorithm three-fold: (1)we change the 1-D chaotic Logistic map to a piecewise linear chaotic map (PWLCM) to improve the balance property, (2)we increase the key size to 128 bits, and (3)-we add two more cryptographic primitives and extend the scheme to operate on multiple rounds so that the chosen/known-plaintext attacks are no longer possible. The new cipher has much stronger security and its performance characteristics remain very good. A security analysis for the proposed system is performed and presented.