scholarly journals Image Encryption Using the Chaotic Josephus Matrix

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Gelan Yang ◽  
Huixia Jin ◽  
Na Bai
Keyword(s):  
Image Encryption ◽  
Chaotic Maps ◽  
Data Encryption ◽  
Input Image ◽  
Matrix Form ◽  
Encrypted Image ◽  
Design Idea ◽  
Simulation Results ◽  
Very High

This paper presents a new image encryption solution using the chaotic Josephus matrix. It extends the conventional Josephus traversing to a matrix form and proposes a treatment to improve the randomness of this matrix by mixing chaotic maps. It also derives the corresponding encryption primitives controlled by the chaotic Josephus matrix. In this way, it builds up an image encryption system with very high sensitivities in both encryption key and input image. Our simulation results demonstrate that an encrypted image of using this method is very random-like, that is, a uniform-like pixel histogram and very low correlations in adjacent pixels. The design idea of this method is also applicable to data encryption of other types, like audio and video.

scholarly journals Magic cube puzzle approach for image encryption

2020 ◽  
Vol 6 (3) ◽  
pp. 290
Author(s):  
Achmad Fanany Onnilita Gaffar ◽  
Rheo Malani ◽  
Arief Bramanto Wicaksono Putra
Keyword(s):  
Image Encryption ◽  
Performance Metrics ◽  
Random Permutation ◽  
Data Encryption ◽  
Large Space ◽  
Encrypted Image ◽  
Plain Image ◽  
Block Based ◽  
Key Length ◽  
Magic Cube

In principle, the image encryption algorithm produces an encrypted image. The encrypted image is composed of arbitrary patterns that do not provide any clues about the plain image and its cipher key. Ideally, the encrypted image is entirely independent of its plain image. Many functions can be used to achieve this goal. Based on the functions used, image encryption techniques are categorized into: (1) Block-based; (2) Chaotic-based; (3) Transformation-based; (4) Conventional-based; and (5) Miscellaneous based. This study proposes a magic cube puzzle approach to encrypt an 8-bit grayscale image. This approach transforms a plain image into a particular size magic cube puzzle, which is consists of a set of blocks. The magic cube puzzle algorithm will diffuse the pixels of the plain image as in a Rubik’s Cube game, by rotating each block in a particular direction called the transposition orientation. The block’s transposition orientation is used as the key seed, while the generation of the cipher key uses a random permutation of the key seed with a certain key length. Several performance metrics have been used to assess the goals, and the results have been compared to several standard encryption methods. This study showed that the proposed method was better than the other methods, except for entropy metrics. For further studies, modification of the method will be carried out in such a way as to be able to increase its entropy value to very close to 8 and its application to true color images. In essence, the magic cube puzzle approach has a large space for pixel diffusion that is possibly supposed to get bigger as a series of data has transformed into several magic cubes. Then, each magic cube has transposed with a different technique. This proposed approach is expected to add to a wealth of knowledge in the field of data encryption.

scholarly journals A New Image Encryption Scheme Based on Hybrid Chaotic Maps

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-23 ◽  
Author(s):  
Ibrahim Yasser ◽  
Fahmi Khalifa ◽  
Mohamed A. Mohamed ◽  
Ahmed S. Samrah
Keyword(s):  
Image Encryption ◽  
Chaotic Maps ◽  
High Sensitivity ◽  
Data Encryption ◽  
Discrete Wavelet ◽  
Hybrid Technique ◽  
High Security ◽  
Residual Intelligibility ◽  
And Diffusion ◽  
Image Encryption Algorithm

Chaos-based encryption algorithms offer many advantages over conventional cryptographic algorithms, such as speed, high security, affordable overheads for computation, and procedure power. In this paper, we propose a novel perturbation algorithm for data encryption based on double chaotic systems. A new image encryption algorithm based on the proposed chaotic maps is introduced. The proposed chaotification method is a hybrid technique that parallels and combines the chaotic maps. It is based on combination between Discrete Wavelet Transform (DWT) to decompose the original image into sub-bands and both permutation and diffusion properties are attained using the chaotic states and parameters of the proposed maps, which are then concerned in shuffling of pixel and operations of substitution, respectively. Security, statistical test analyses, and comparison with other techniques indicate that the proposed algorithm has promising effect and it can resist several common attacks. Namely, the average values for UACI and NPCR metrics were 33.6248% and 99.6472%, respectively. Additionally, unscrambling quality can fulfill security and execution prerequisites as evidenced by PSNR (9.005955) and entropy (7.999275) values. In sum, the proposed method has enough ability to achieve low residual intelligibility with high quality recovered data, high sensitivity, and high security performance compared to some other recent literature approaches.

Image Encryption Algorithm Based on Genetic Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1512-1516
Author(s):  
Gui Liang Zhu ◽  
Wei Ping Wang ◽  
Xiao Qiang Zhang
Keyword(s):  
Genetic Algorithm ◽  
Image Encryption ◽  
Encryption Algorithm ◽  
Encrypted Image ◽  
Simulation Results ◽  
Selection Operator ◽  
Crossover And Mutation ◽  
Image Encryption Algorithm

According to the idea of genetic algorithm, a new image encryption algorithm is proposed. Define each pixel of the image as a gene, each row of the image as a chromosome, the whole image as an organism. Then we design a selection operator, which based on SVD. After the operation of selection, crossover and mutation of the image, we can get the encrypted image. The simulation results show that very nice encryption effects and good robustness are obtained and the high safety of the new algorithm are analyzed.

scholarly journals Reversible Integer Wavelet Transform for the Joint of Image Encryption and Watermarking

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Bin Wang
Keyword(s):  
Wavelet Transform ◽  
Image Encryption ◽  
Chaotic Maps ◽  
Integer Wavelet Transform ◽  
Histogram Modification ◽  
Encrypted Image ◽  
Considerable Research ◽  
Plain Image ◽  
Lossless Watermarking ◽  
Integer Wavelet

In recent years, signal processing in the encrypted domain has attracted considerable research interest, especially embedding watermarking in encrypted image. In this work, a novel joint of image encryption and watermarking based on reversible integer wavelet transform is proposed. Firstly, the plain-image is encrypted by chaotic maps and reversible integer wavelet transform. Then the lossless watermarking is embedded in the encrypted image by reversible integer wavelet transform and histogram modification. Finally an encrypted image containing watermarking is obtained by the inverse integer wavelet transform. What is more, the original image and watermarking can be completely recovered by inverse process. Numerical experimental results and comparing with previous works show that the proposed scheme possesses higher security and embedding capacity than previous works. It is suitable for protecting the image information.

scholarly journals A New Chaos-based Approach for Robust Image Encryption

2021 ◽  
pp. 51-64
Author(s):  
Fahmi Khalifa ◽  
◽  
◽  
◽  
◽  
...  
Keyword(s):  
Image Encryption ◽  
Chaotic Maps ◽  
Security Analysis ◽  
High Sensitivity ◽  
Data Encryption ◽  
High Security ◽  
Robust Image ◽  
A New Technique ◽  
Residual Intelligibility

Chaotic encryptions offered various advantages over traditional encryption methods, like high security, speed, reasonable computational overheads. This paper introduces novel perturbation techniques for data encryption based on double chaotic systems. A new technique for image encryption utilizing mixed the proposed chaotic maps is presented. The proposed hybrid system parallels and combines two chaotic maps as part of a new chaotification method. It based on permutation, diffusion and system parameters, which are then involved in pixel shuffling and substitution operations, respectively. Many statistical test and security analysis indicate the validity of the results, e.g., the average values for NPCR and UACI are 99.67145% and 33.63288%, respectively. The proposed technique can achieve low residual intelligibility, high sensitivity and quality of recovered data, high security performance, and it show that the encrypted image has good resistance against attacks.

scholarly journals Image Statistics Preserving Encrypt-then-Compress Scheme Dedicated for JPEG Compression Standard

Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 421
Author(s):  
Dariusz Puchala ◽  
Kamil Stokfiszewski ◽  
Mykhaylo Yatsymirskyy
Keyword(s):  
Statistical Analysis ◽  
Image Encryption ◽  
Experimental Studies ◽  
Quality Measures ◽  
Input Image ◽  
Jpeg Compression ◽  
Image Statistics ◽  
Compression Stage ◽  
Wide Range ◽  
The Impact

In this paper, the authors analyze in more details an image encryption scheme, proposed by the authors in their earlier work, which preserves input image statistics and can be used in connection with the JPEG compression standard. The image encryption process takes advantage of fast linear transforms parametrized with private keys and is carried out prior to the compression stage in a way that does not alter those statistical characteristics of the input image that are crucial from the point of view of the subsequent compression. This feature makes the encryption process transparent to the compression stage and enables the JPEG algorithm to maintain its full compression capabilities even though it operates on the encrypted image data. The main advantage of the considered approach is the fact that the JPEG algorithm can be used without any modifications as a part of the encrypt-then-compress image processing framework. The paper includes a detailed mathematical model of the examined scheme allowing for theoretical analysis of the impact of the image encryption step on the effectiveness of the compression process. The combinatorial and statistical analysis of the encryption process is also included and it allows to evaluate its cryptographic strength. In addition, the paper considers several practical use-case scenarios with different characteristics of the compression and encryption stages. The final part of the paper contains the additional results of the experimental studies regarding general effectiveness of the presented scheme. The results show that for a wide range of compression ratios the considered scheme performs comparably to the JPEG algorithm alone, that is, without the encryption stage, in terms of the quality measures of reconstructed images. Moreover, the results of statistical analysis as well as those obtained with generally approved quality measures of image cryptographic systems, prove high strength and efficiency of the scheme’s encryption stage.

Sign in / Sign up

Export Citation Format

Share Document