A Novel Image Encryption Based on Algebraic S-box and Arnold Transform

3D Research ◽  
2017 ◽  
Vol 8 (3) ◽  
Author(s):  
Shabieh Farwa ◽  
Nazeer Muhammad ◽  
Tariq Shah ◽  
Sohail Ahmad
Keyword(s):  
Image Encryption ◽  
Arnold Transform

Image encryption based on Fractional wavelet transform, Arnold transform with the double random phases in HSV color domain

2020 ◽  
Vol 13 ◽  
Author(s):  
Aarushi Shrivastava ◽  
Janki Ballabh Sharma ◽  
Sunil Dutt Purohit
Keyword(s):  
Wavelet Transform ◽  
Image Encryption ◽  
Fractional Fourier Transform ◽  
Color Image ◽  
Random Phase ◽  
Arnold Transform ◽  
Time Frequency ◽  
Key Space ◽  
Secret Keys ◽  
Fractional Wavelet Transform

Objective: In the recent multimedia technology images play an integral role in communication. Here in this paper, we propose a new color image encryption method using FWT (Fractional Wavelet transform), double random phases and Arnold transform in HSV color domain. Methods: Firstly the image is changed into the HSV domain and the encoding is done using the FWT which is the combination of the fractional Fourier transform with wavelet transform and the two random phase masks are used in the double random phase encoding. In this one inverse DWT is taken at the end in order to obtain the encrypted image. To scramble the matrices the Arnold transform is used with different iterative values. The fractional order of FRFT, the wavelet family and the iterative numbers of Arnold transform are used as various secret keys in order to enhance the level of security of the proposed method. Results: The performance of the scheme is analyzed through its PSNR and SSIM values, key space, entropy, statistical analysis which demonstrates its effectiveness and feasibility of the proposed technique. Stimulation result verifies its robustness in comparison to nearby schemes. Conclusion: This method develops the better security, enlarged and sensitive key space with improved PSNR and SSIM. FWT reflecting time frequency information adds on to its flexibility with additional variables and making it more suitable for secure transmission.

scholarly journals Double Quantum Image Encryption Based on Arnold Transform and Qubit Random Rotation

Entropy ◽  
2018 ◽  
Vol 20 (11) ◽  
pp. 867 ◽  
Author(s):  
Xingbin Liu ◽  
Di Xiao ◽  
Cong Liu
Keyword(s):  
Computational Complexity ◽  
Image Encryption ◽  
Superior Performance ◽  
Double Quantum ◽  
Arnold Transform ◽  
Quantum Image ◽  
Classical Counterpart ◽  
Quantum Image Encryption ◽  
Random Rotation ◽  
Key Space

Quantum image encryption offers major advantages over its classical counterpart in terms of key space, computational complexity, and so on. A novel double quantum image encryption approach based on quantum Arnold transform (QAT) and qubit random rotation is proposed in this paper, in which QAT is used to scramble pixel positions and the gray information is changed by utilizing random qubit rotation. Actually, the independent random qubit rotation operates once, respectively, in spatial and frequency domains with the help of quantum Fourier transform (QFT). The encryption process accomplishes pixel confusion and diffusion, and finally the noise-like cipher image is obtained. Numerical simulation and theoretical analysis verify that the method is valid and it shows superior performance in security and computational complexity.

scholarly journals Quantum Image Encryption Scheme Using Arnold Transform and S-box Scrambling

Entropy ◽  
2019 ◽  
Vol 21 (4) ◽  
pp. 343 ◽  
Author(s):  
Hui Liu ◽  
Bo Zhao ◽  
Linquan Huang
Keyword(s):  
Image Encryption ◽  
Quantum Chaos ◽  
Initial Conditions ◽  
Chaotic Map ◽  
Gray Level ◽  
Encryption Scheme ◽  
Arnold Transform ◽  
Quantum Image ◽  
Quantum Image Encryption ◽  
Mutation Operation

The paper proposes a lossless quantum image encryption scheme based on substitution tables (S-box) scrambling, mutation operation and general Arnold transform with keys. First, the key generator builds upon the foundation of SHA-256 hash with plain-image and a random sequence. Its output value is used to yield initial conditions and parameters of the proposed image encryption scheme. Second, the permutation and gray-level encryption architecture is built by discrete Arnold map and quantum chaotic map. Before the permutation of Arnold transform, the pixel value is modified by quantum chaos sequence. In order to get high scrambling and randomness, S-box and mutation operation are exploited in gray-level encryption stage. The combination of linear transformation and nonlinear transformation ensures the complexity of the proposed scheme and avoids harmful periodicity. The simulation shows the cipher-image has a fairly uniform histogram, low correlation coefficients closed to 0, high information entropy closed to 8. The proposed cryptosystem provides 2256 key space and performs fast computational efficiency (speed = 11.920875 Mbit/s). Theoretical analyses and experimental results prove that the proposed scheme has strong resistance to various existing attacks and high level of security.

A Watermark Preprocessing Algorithm Based on Arnold Transformation and Logistic Chaotic Map

2011 ◽  
Vol 341-342 ◽  
pp. 720-724 ◽  
Author(s):  
Wang Sheng Fang ◽  
Lu Lu Wu ◽  
Rong Zhang
Keyword(s):  
Correlation Analysis ◽  
Image Encryption ◽  
Chaotic Map ◽  
Encryption Algorithm ◽  
Arnold Transform ◽  
Key Space ◽  
Key Sensitivity ◽  
Logistic Chaotic Map ◽  
Arnold Transformation ◽  
Image Encryption Algorithm

One of the main purpose of the watermark preprocessing is to improve the robustness and security. For this reason,this paper presents an image encryption algorithm, which combines position scrambling and gray scrambling scrambled according to Arnold transform.Then all of the pixels of each sub-block are scambled by the algorithm based on Logistic chaotic map.Finally, all of the Pixels are redistributed and scrambled totally.Basing on image location scrambling,it takes advantage of multi-dimensional Arnold transformation and Logistic chaotic map, image gray scrambling is achieved. By histogram analysis,key sensitivity anslysis and correlation analysis of adjacent pixels of the results of the simulation, indicating that the scrambling effect of the algorithm is good,and the key space is large.

Sign in / Sign up

Export Citation Format

Share Document