scholarly journals A Novel Image Encryption Technique Based on Mobius Transformation

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Muhammad Asif ◽  
Sibgha Mairaj ◽  
Zafar Saeed ◽  
M. Usman Ashraf ◽  
Kamal Jambi ◽  
...  

The nonlinear transformation concedes as S-box which is responsible for the certainty of contemporary block ciphers. Many kinds of S-boxes are planned by various authors in the literature. Construction of S-box with a powerful cryptographic analysis is the vital step in scheming block cipher. Through this paper, we give more powerful and worthy S-boxes and compare their characteristics with some previous S-boxes employed in cryptography. The algorithm program planned in this paper applies the action of projective general linear group P G L 2 , G F 2 8 on Galois field G F 2 8 . The proposed S-boxes are constructed by using Mobius transformation and elements of Galois field. By using this approach, we will encrypt an image which is the preeminent application of S-boxes. These S-boxes offer a strong algebraic quality and powerful confusion capability. We have tested the strength of the proposed S-boxes by using different tests, BIC, SAC, DP, LP, and nonlinearity. Furthermore, we have applied these S-boxes in image encryption scheme. To check the strength of image encryption scheme, we have calculated contrast, entropy, correlation, energy, and homogeneity. The results assured that the proposed scheme is better. The advantage of this scheme is that we can secure our confidential image data during transmission.

Author(s):  
N. Mohananthini ◽  
M. Y. Mohamed Parvees ◽  
J. Abdul Samath

Nowadays, lightweight cryptography attracts academicians, scientists and researchers to concentrate on its requisite with the increasing usage of low resource devices. In this paper, a new lightweight image encryption scheme is proposed using the Lorenz 3D super chaotic map. This encryption scheme is an addition–rotation–XOR block cipher designed for its supremacy, efficacy and speed execution. In this addition–rotation–XOR cipher, the equation for Lorenz 3D chaotic map is iteratively solved to generate double valued signals in a speedy manner using the Runge–Kutta and Euler methods. The addition, rotation and diffusion sequences are generated from the double valued signals, and the source pixels of the 8-bit plain test images are manipulated with the addition, rotation and diffusion of the bytes. Finally, the cipher images are constructed from the manipulated pixels and evaluated with various statistical as well as randomness tests. The results from various tests prove that the proposed chaotic addition–rotation–XOR block image cipher is efficient in terms of randomness and speed.


2014 ◽  
Vol 69 (1-2) ◽  
pp. 61-69 ◽  
Author(s):  
Xing-Yuan Wang ◽  
Xue-Mei Bao

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.


2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Riguang Lin ◽  
Sheng Li

This research proposes a new image encryption scheme based on Lorenz hyperchaotic system and Rivest–Shamir–Adleman (RSA) algorithm. Firstly, the initial values of the Lorenz hyperchaotic system are generated by RSA algorithm, and the key stream is produced iteratively. In order to change the position and gray value of the pixel, the image data are hidden by additive mode diffusion. Secondly, the diffusion image matrix is reshaped into a one-dimensional image matrix, which is confused without repetition to hide the image data again. Then, the finite field diffusion algorithm is executed to realize the third hiding of the image information. In order to diffuse the pixel information into the entire cipher image, the additive mode diffusion algorithm needs to be looped twice. Finally, the cipher image can be obtained. The experimental results prove that the image encryption scheme proposed in this research is effective and has strong antiattack and key sensitivity. Moreover, the security of this encryption scheme relies on the RSA algorithm, which has high security.


2015 ◽  
Vol 14 (11) ◽  
pp. 6258-6267
Author(s):  
Ari Shawkat Tahir

Cryptography algorithms are becoming more necessary to ensure secure data transmission, which can be used in several applications. Increasing use of images in industrial process therefore it is essential to protect the confidential image data from unauthorized access. Advanced Encryption Standard (AES) is a well- known block cipher that has many benefits in data encryption process.  In this paper, proposed some modification to the Advanced Encryption Standard (M-AES) to increase and reaching high level security and enhance image encryption. The modification is done by modifying the ShiftRow Transformation. Detailed results in terms of security analysis and implementation are given. Comparing the proposed algorithm with the original AES encryption algorithm shows that the proposed M-AES has more security from the cryptographic view and gives better result of security against statistical attack.


2021 ◽  
Vol 71 (2) ◽  
pp. 209-221
Author(s):  
Ram Ratan ◽  
Arvind Yadav

A selective bit-plane encryption scheme was proposed for securing the transmission of image data in mobile environments with a claim that it provides a high security viz. the encryption of the four most significant bit-planes is sufficient for a high image data security. This paper presents the security analysis of the said encryption scheme and reports new important results. We perform the security analysis of the bit-level encryption by considering the normal images and their histogram equalised enhanced images. We consider different bit-plane aspects to analyse the security of the image encryption, and show that the encryption of the four most significant bit-planes is not adequate. The contents of the images can be obtained even when all the bit-planes except one least significant bit-plane are encrypted in the histogram equalised images as shown in the results. The bit-plane level security analysis seems very useful for the analysis of the bit-plane level image encryption schemes.


2020 ◽  
Vol 2020 ◽  
pp. 1-14 ◽  
Author(s):  
Kaixin Jiao ◽  
Guodong Ye ◽  
Youxia Dong ◽  
Xiaoling Huang ◽  
Jianqing He

This study proposes a new image encryption scheme based on a generalized Arnold map and Rivest–Shamir–Adleman (RSA) algorithm. First, the parameters of the generalized Arnold map are generated by an asymmetric encryption-system RSA algorithm, and the keystream is produced iteratively. To change the distribution of pixel values, the image data are hidden by XOR diffusion. Second, both rows and columns of the image are cyclically confused to hide the image data again. Then, the additive mode diffusion operation is performed to realize third-layer hiding for image content. The overall diffusion and confusion operations are conducted twice to obtain the final cipher image. Test results prove that the encryption scheme proposed in this study is effective and has strong antiattack capabilities and key sensitivity. In addition, because the scheme security relies on the RSA algorithm, it has high security.


2020 ◽  
Vol 2020 ◽  
pp. 1-22 ◽  
Author(s):  
Lilian Huang ◽  
Shiming Wang ◽  
Jianhong Xiang ◽  
Yi Sun

This paper proposes a chaotic color image encryption scheme based on DNA-coding calculations and arithmetic over the Galois field. Firstly, three modified one-dimensional (1D) chaotic maps with larger key space and better chaotic characteristics are presented. The experimental results show that their chaotic intervals are not only expanded to 0,15, but their average largest Lyapunov Exponent reaches 10. They are utilized as initial keys. Secondly, DNA coding and calculations are applied in order to add more permutation of the cryptosystem. Ultimately, the numeration over the Galois field ensures the effect for the diffusion of pixels. The simulation analysis shows that the encryption scheme proposed in this paper has good encryption effect, and the numerical results verify that it has higher security than some of the latest cryptosystems.


Sign in / Sign up

Export Citation Format

Share Document