scholarly journals Two-Phase Image Encryption Scheme Based on FFCT and Fractals

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Mervat Mikhail ◽  
Yasmine Abouelseoud ◽  
Galal ElKobrosy
Keyword(s):  
Image Encryption ◽  
Phase Image ◽  
Encryption Scheme ◽  
Two Phase ◽  
Analysis Techniques ◽  
Fractal Images ◽  
Symmetric Key ◽  
Cryptographic Attacks ◽  
Symmetric Key Cryptography ◽  
Differential Attacks

This paper blends the ideas from recent researches into a simple, yet efficient image encryption scheme for colored images. It is based on the finite field cosine transform (FFCT) and symmetric-key cryptography. The FFCT is used to scramble the image yielding an image with a uniform histogram. The FFCT has been chosen as it works with integers modulo p and hence avoids numerical inaccuracies inherent to other transforms. Fractals are used as a source of randomness to generate a one-time-pad keystream to be employed in enciphering step. The fractal images are scanned in zigzag manner to ensure decorrelation of adjacent pixels values in order to guarantee a strong key. The performance of the proposed algorithm is evaluated using standard statistical analysis techniques. Moreover, sensitivity analysis techniques such as resistance to differential attacks measures, mean square error, and one bit change in system key have been investigated. Furthermore, security of the proposed scheme against classical cryptographic attacks has been analyzed. The obtained results show great potential of the proposed scheme and competitiveness with other schemes in literature. Additionally, the algorithm lends itself to parallel processing adding to its computational efficiency.

scholarly journals AN APPROACH TO IMAGE COMPRESSION AND ENCRYPTION

2012 ◽  
pp. 146-149
Author(s):  
ABDUL RAZZAQUE ◽  
NILESHSINGH V. THAKUR
Keyword(s):  
Image Compression ◽  
Image Encryption ◽  
Encryption Scheme ◽  
Secret Key ◽  
Image Size ◽  
Compression Scheme ◽  
Unauthorized Access ◽  
Symmetric Key ◽  
Symmetric Key Cryptography ◽  
Image Compression And Encryption

Image compression scheme proposed by researchers have no consideration of security. Similarly image encryption scheme proposed by the authors have no consideration of image size. In this paper a simultaneous image compression and encryption scheme is discussed. The order of the two processes viz. compression and encryption is EC i.e. image encryption is performed first then the image compression is applied. For image encryption a symmetric key cryptography multiplicative cipher is used. Similarly for compression Discrete Cosine Transform is used. Image Compression is concerned with minimizing the number of bit required to represent an image. The compression can be lossless or lossy. Image Encryption is hiding image from unauthorized access with the help of secret key that key can be private or public.

scholarly journals Splicing Model and Hyper–Chaotic System for Image Encryption

2016 ◽  
Vol 67 (2) ◽  
pp. 78-86 ◽  
Author(s):  
Hongye Niu ◽  
Changjun Zhou ◽  
Bin Wang ◽  
Xuedong Zheng ◽  
Shihua Zhou
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Dna Computing ◽  
Formal Model ◽  
Security Analysis ◽  
The Internet ◽  
Encryption Scheme ◽  
Image Information ◽  
Plain Image ◽  
Differential Attacks

Abstract Encryption is an effective way to protect the image information from attacking by intruders in the transmission applications through the Internet. This study presents an image encryption scheme on the basics of the formal model of DNA computing-splicing system and hyper-chaotic system, which utilizes the instinct properties of hyper-chaotic system and splicing model while programming the method. In our proposed algorithm, the quaternary coding is used to split the plain image into four sub-sections so that we can’t get the cipher image without any one sub-section. This new method can be used to change the plain image information drastically. The experimental results and security analysis show that our method not only has a good security but also increases the resistance to common attacks such as exhaustive attacks, statistical attacks and differential attacks.

scholarly journals A Three-Dimensional Infinite Collapse Map with Image Encryption

Entropy ◽  
2021 ◽  
Vol 23 (9) ◽  
pp. 1221
Author(s):  
Wenhao Yan ◽  
Zijing Jiang ◽  
Xin Huang ◽  
Qun Ding
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Chaotic Behavior ◽  
Security Analysis ◽  
Three Dimensional ◽  
Security Level ◽  
Encryption Scheme ◽  
Encryption Schemes ◽  
Low Dimensional ◽  
Differential Attacks

Chaos is considered as a natural candidate for encryption systems owing to its sensitivity to initial values and unpredictability of its orbit. However, some encryption schemes based on low-dimensional chaotic systems exhibit various security defects due to their relatively simple dynamic characteristics. In order to enhance the dynamic behaviors of chaotic maps, a novel 3D infinite collapse map (3D-ICM) is proposed, and the performance of the chaotic system is analyzed from three aspects: a phase diagram, the Lyapunov exponent, and Sample Entropy. The results show that the chaotic system has complex chaotic behavior and high complexity. Furthermore, an image encryption scheme based on 3D-ICM is presented, whose security analysis indicates that the proposed image encryption scheme can resist violent attacks, correlation analysis, and differential attacks, so it has a higher security level.

scholarly journals An Effective Chaos-Based Image Encryption Scheme Using Imitating Jigsaw Method

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Zhen Li ◽  
Changgen Peng ◽  
Weijie Tan ◽  
Liangrong Li
Keyword(s):  
Image Encryption ◽  
Initial Conditions ◽  
Encryption Scheme ◽  
Original Image ◽  
Speed Performance ◽  
Plain Image ◽  
Jigsaw Method ◽  
Pixel Image ◽  
Differential Attacks ◽  
Control Sequences

In this paper, an efficient chaos-based image encryption scheme is proposed, which uses the imitating jigsaw method containing revolving and shifting operations. In this scheme, there are three processes in encryption: preprocessing, encryption process, and postprocessing. In the preprocessing, the original image is partitioned into 64 × 64 pixel image blocks and then randomly revolved and shifted under control sequences which are generated by the hyperchaotic Lorenz system whose initial conditions are calculated by original image and keys. Therefore, the preprocessing is sensitive to plain image against differential attacks. In the encryption process, the after-preprocessing image is partitioned into 32 × 32 pixel image blocks; next they are randomly revolved and encrypted by control sequence and key blocks which are generated by the skew tent map. In postprocessing, the after-encryption image is partitioned into 16 × 16 pixels’ image blocks, and they are randomly revolved and shifted again under control sequences which are related with encrypted image and keys. The postprocessing further increases the diffusion characteristics. Moreover, the test experiment and security analyses are given; the results show that our proposed cryptosystem has both security and speed performance.

scholarly journals Cryptanalysis of Permutation–Diffusion-Based Lightweight Chaotic Image Encryption Scheme Using CPA

2019 ◽  
Vol 9 (3) ◽  
pp. 494
Author(s):  
Ming Li ◽  
Kanglei Zhou ◽  
Hua Ren ◽  
Haiju Fan
Keyword(s):  
Image Encryption ◽  
Encryption Scheme ◽  
Secret Key ◽  
Chosen Plaintext Attack ◽  
Image Communication ◽  
Diffusion Phase ◽  
Chaotic Image Encryption ◽  
Differential Attacks ◽  
And Diffusion ◽  
Attack Strategy

In order to meet the requirement of secure image communication in a resource-constrained network environment, a novel lightweight chaotic image encryption scheme based on permutation and diffusion has been proposed. It was claimed that this scheme can resist differential attacks, statistical attacks, etc. However, the original encryption scheme is found to be vulnerable and insecure to chosen-plaintext attack (CPA). In this paper, the original encryption scheme is analyzed comprehensively and attacked successfully. Only by choosing a full zero image as the chosen-plaintext of the diffusion phase, the encrypted image can be restored into permutation-only phase, and by applying the other chosen images as the chosen-plaintexts of the permutation phase, the map matrix which is equivalent to the secret key of the permutation phase can be further revealed. Experiments and analysis verify the feasibility of our proposed attack strategy.

Sign in / Sign up

Export Citation Format

Share Document