Image encryption scheme based on a Gaussian apertured reality-preserving fractional Mellin transform

2020 ◽  
Vol 50 (3) ◽  
Author(s):  
Mengmeng Wang ◽  
Yannis Pousset ◽  
Phillippe Carré ◽  
Clency Perrine ◽  
Nanrun Zhou ◽  
...  
Keyword(s):  
Theoretical Analysis ◽  
Image Encryption ◽  
Process Simulation ◽  
Mellin Transform ◽  
Nonlinear Transformation ◽  
Encryption Scheme ◽  
Arnold Transform ◽  
Cipher Text ◽  
Xor Operation ◽  
Simulation Results

An image encryption scheme based on a Gaussian apertured reality-preserving fractional Mellin transform (GARPFrMT) is proposed. The GARPFrMT was realized in the diffraction domain. The Gaussian aperture, like a soft aperture, improved the amount of light that passed through the lens compared to a hard aperture and reduced the light leakage at the edge of the lens, assisting to some extent in resisting direct attacks. In the proposed scheme, the reality-preserving transform was constructed in the diffraction domain to ensure that the cipher-text is real. The GARPFrMT is a nonlinear transformation used for eliminating potential insecurity existing in the linear image encryption system. In order to further enhance the security of the encryption system, an Arnold transform, and a bitwise XOR operation were employed for permutation and scrambling in the encryption process. Simulation results and theoretical analysis show that the proposed algorithm is feasible and capable of withstanding several common attacks.

scholarly journals Cryptanalysis of a New Chaotic Image Encryption Technique Based on Multiple Discrete Dynamical Maps

Entropy ◽  
2021 ◽  
Vol 23 (12) ◽  
pp. 1581
Author(s):  
Haiju Fan ◽  
Chenjiu Zhang ◽  
Heng Lu ◽  
Ming Li ◽  
Yanfang Liu
Keyword(s):  
Image Encryption ◽  
Strong Correlation ◽  
Digital Images ◽  
Computational Cost ◽  
Encryption Scheme ◽  
Discrete Dynamic ◽  
Diffusion Structure ◽  
Plain Image ◽  
Simulation Results ◽  
Chaotic Image Encryption

Recently, a new chaotic image encryption technique was proposed based on multiple discrete dynamic maps. The authors claim that the scheme can provide excellent privacy for traditional digital images. However, in order to minimize the computational cost, the encryption scheme adopts one-round encryption and a traditional permutation–diffusion structure. Through cryptanalysis, there is no strong correlation between the key and the plain image, which leads to the collapse of cryptosystem. Based on this, two methods of chosen-plaintext attacks are proposed in this paper. The two methods require 3 pairs and 258 pairs of plain and cipher images, respectively, to break the original encryption system. The simulation results show the effectiveness of the two schemes.

scholarly journals A Multi-Image Encryption with Super-Lager-Capacity Based on Spherical Diffraction and Filtering Diffusion

2020 ◽  
Vol 10 (16) ◽  
pp. 5691
Author(s):  
Hanmeng Wu ◽  
Jun Wang ◽  
Ziyi Zhang ◽  
Xudong Chen ◽  
Zheng Zhu
Keyword(s):  
Numerical Simulation ◽  
Image Encryption ◽  
Phase Retrieval ◽  
Image Resolution ◽  
Large Capacity ◽  
Equal Modulus Decomposition ◽  
Xor Operation ◽  
Simulation Results ◽  
The Asymmetry ◽  
High Flexibility

A multi-image encryption with super-large-capacity is proposed by using spherical diffraction and filtering diffusion. In the proposed method, initial images are processed sequentially by filtering diffusion and chaos scrambling. The images are combined into one image using XOR operation. The combined image is encrypted by improved equal modulus decomposition after spherical diffraction. There are three main contributions of the proposed method—(1) resisting phase-retrieval attack due to the asymmetry of spherical diffraction; (2) high flexibility of decrypting images individually; and (3) super-large encryption capacity of the product of image resolution and grayscale level, which is the most significant advantage. The feasibility and effectiveness of the proposed encryption are verified by numerical simulation results.

A novel image encryption scheme based on orthogonal matrix, skew tent map, and XOR operation

2017 ◽  
Vol 30 (12) ◽  
pp. 3847-3857 ◽  
Author(s):  
Jawad Ahmad ◽  
Muazzam Ali Khan ◽  
Fawad Ahmed ◽  
Jan Sher Khan
Keyword(s):  
Image Encryption ◽  
Orthogonal Matrix ◽  
Encryption Scheme ◽  
Tent Map ◽  
Skew Tent Map ◽  
Xor Operation

An Efficient Fully Homomorphic Encryption Scheme for Private Information Retrieval in the Cloud

2019 ◽  
Vol 34 (04) ◽  
pp. 2055008
Author(s):  
Xun Wang ◽  
Tao Luo ◽  
Jianfeng Li
Keyword(s):  
Information Retrieval ◽  
Theoretical Analysis ◽  
Private Information ◽  
Homomorphic Encryption ◽  
Private Information Retrieval ◽  
Encryption Scheme ◽  
Fully Homomorphic Encryption ◽  
Encrypted Data ◽  
Privacy Concerns ◽  
Simulation Results

Information retrieval in the cloud is common and convenient. Nevertheless, privacy concerns should not be ignored as the cloud is not fully trustable. Fully Homomorphic Encryption (FHE) allows arbitrary operations to be performed on encrypted data, where the decryption of the result of ciphertext operation equals that of the corresponding plaintext operation. Thus, FHE schemes can be utilized for private information retrieval (PIR) on encrypted data. In the FHE scheme proposed by Ducas and Micciancio (DM), only a single homomorphic NOT AND (NAND) operation is allowed between consecutive ciphertext refreshings. Aiming at this problem, an improved FHE scheme is proposed for efficient PIR where homomorphic additions and multiplications are based on linear operations on ciphertext vectors. Theoretical analysis shows that when compared with the DM scheme, the proposed scheme allows multiple homomorphic additions and a single homomorphic multiplication to be performed. The number of allowed homomorphic additions is determined by the ratio of the ciphertext modulus to the upper bound of initial ciphertext noise. Moreover, simulation results show that the proposed scheme is significantly faster than the DM scheme in the homomorphic evaluation for a series of algorithms.

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 New Color Image Encryption Scheme Based on Chaos

2014 ◽  
Vol 602-605 ◽  
pp. 3498-3502 ◽  
Author(s):  
Huai Xun Zhao ◽  
Peng Cheng ◽  
Jun Hao Han
Keyword(s):  
Image Encryption ◽  
Color Image ◽  
Logistic Map ◽  
Diffusion Method ◽  
Encryption Scheme ◽  
Color Image Encryption ◽  
Simple Diffusion ◽  
Color Component ◽  
Simulation Results

This letter presents a new color image encryption scheme based on the coupled chaos maps. First, the algorithm uses the coupled logistic map to generate random strong key stream, and then designed a kind of initial simple diffusion-joint scrambling-combined diffusion method from the point of the relationships of components R, G, B. The simulation results indicate that this algorithm has stronger security compared with the independent encryption of each color component.

A Wheel-Switch Selective Image Encryption Scheme Using Spatiotemporal Chaotic System

2014 ◽  
Vol 69 (1-2) ◽  
pp. 61-69 ◽  
Author(s):  
Xing-Yuan Wang ◽  
Xue-Mei Bao
Keyword(s):  
Theoretical Analysis ◽  
Image Encryption ◽  
Chaotic System ◽  
Initial Conditions ◽  
Image Data ◽  
Encryption Scheme ◽  
Cyclic Shift ◽  
Coupling Constant ◽  
Plain Image ◽  
Spatiotemporal Chaotic System

In this paper, we propose a novel selective image encryption scheme using a one-way coupled map lattice (CML) consisting of logistic maps and a selector constructed by two variants of a cyclic shift register (VCSR). The initial conditions and the coupling constant of CML in our scheme are influenced by all the contents of the plain image. Moreover, the selector is closely related to the nonencrypted part of the plain image. In addition, we select only a portion of image data to encrypt via a wheel-switch scheme governed by the selector. Users can select an appropriate proportion to encrypt the plain image for their different demands of security and efficiency. Experimental results and theoretical analysis show that the cryptosystem is effective and can resist various typical attacks.

scholarly journals Cryptanalysis and Improvement of Chaos-Based Image Encryption Scheme with Circular Inter-Intra-Pixels Bit-Level Permutation

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Haiju Fan ◽  
Ming Li
Keyword(s):  
Image Encryption ◽  
Encryption Scheme ◽  
Double Crossover ◽  
Plain Image ◽  
Original Scheme ◽  
Simulation Results ◽  
And Diffusion

A novel chaos-based image encryption scheme has been proposed recently. In this scheme, redundancies of the Fridrich’s structure were reduced significantly via a new circular inter-intra-pixels bit-level permutation strategy. However, we proved that the original encryption scheme is vulnerable to the known/chosen-plaintext attacks. Both the permutation and diffusion phases have been improved to enhance the security of the original scheme. By shifting each row of the plain image randomly, known-plaintext attacks could be resisted. Furthermore, by appending double crossover diffusion to the end of the original scheme, chosen-plaintext attacks lost their efficacies. Simulation results demonstrated that the improved encryption scheme outperforms the original one.

scholarly journals BREAKING A CHAOTIC IMAGE ENCRYPTION ALGORITHM BASED ON MODULO ADDITION AND XOR OPERATION

2013 ◽  
Vol 23 (04) ◽  
pp. 1350075 ◽  
Author(s):  
CHENGQING LI ◽  
YUANSHENG LIU ◽  
LEO YU ZHANG ◽  
MICHAEL Z. Q. CHEN
Keyword(s):  
Theoretical Analysis ◽  
Image Encryption ◽  
Experimental Results ◽  
Encryption Algorithm ◽  
Composite Function ◽  
Xor Operation ◽  
Chaotic Image Encryption ◽  
Image Encryption Algorithm

This paper re-evaluates the security of a chaotic image encryption algorithm called MCKBA/ HCKBA and finds that it can be broken efficiently with two known plain-images and the corresponding cipher-images. In addition, it is reported that a previously proposed breaking on MCKBA/HCKBA can be further improved by reducing the number of chosen plain-images from four to two. The two attacks are both based on the properties of solving a composite function involving the carry bit, which is composed of the modulo addition and the bitwise OR operations. Both rigorous theoretical analysis and detailed experimental results are provided.

Optical image encryption scheme based on apertured fractional Mellin transform

2020 ◽  
Vol 124 ◽  
pp. 106001 ◽  
Author(s):  
Mengmeng Wang ◽  
Yannis Pousset ◽  
Phillippe Carré ◽  
Clency Perrine ◽  
Nanrun Zhou ◽  
...  
Keyword(s):  
Image Encryption ◽  
Mellin Transform ◽  
Optical Image ◽  
Encryption Scheme ◽  
Optical Image Encryption
Sign in / Sign up

Export Citation Format

Share Document