scholarly journals A Novel Dynamic Secret key Generation for an Efficient Image Encryption Algorithm

2015 ◽  
Vol 9 (13) ◽  
pp. 85
Author(s):  
LAHIEB MOHAMMED JAWAD ◽  
GHAZALI SULONG

<p>Today, the security of digital images is considered more and more essential and a strong secret key plays a major role in the image encryption. In this paper, a novel method for generating dynamic non-linear secret keys for a symmetric block cipher using XOR-operation is proposed. The dynamic non-linear secret keys generation is based on a combination of logistic and piecewise chaotic map methods with a new automatic creation of initial seed values. The automatic initial seed values creation depends on the development of a novel strategy for seeds creation based on sunflower spiral points. The experimental results indicate that the proposed key generator algorithm has the advantage of large key space with a safety protection of brute force attack. Therefore, the performance analysis of image encryption reveals a correlation coefficient of about (-0.0001) and entropy greater than (7.9978). Furthermore, the results show high security for encryption based on strong dynamic secret key properties.</p>

Author(s):  
Kirtee Panwar ◽  
Ravindra Kumar Purwar ◽  
Garima Srivastava

This paper proposes an image encryption technique which is fast and secure. The encryption scheme is designed for secure transmission of video surveillance data (keyframes) over insecure network. The image encryption technique employs 1D Sine–Sine system with better chaotic properties than its seed map and faster than higher-dimensional chaotic systems. Further, design of encryption scheme is based on two permutation rounds, which employs pixel swapping operation and diffusion operation which is simple and provides required security against plaintext, differential and various other attacks. Three separate chaotic sequences are generated using 1D Sine–Sine system which enhances the key space of the encryption scheme. Secret keys are updated dynamically with SHA-256 hash value obtained from plain image. Hash values of plain image are efficiently used without loss of any hash value information. This makes the encryption scheme plaintext sensitive and secure against plaintext attacks. Performance and security aspects of encryption scheme is analyzed both quantitatively using predefined security metrics and qualitatively by scrutinizing the internal working of encryption scheme. Computational complexity of encrypting a plain image of size [Formula: see text] is [Formula: see text] and is suitable for encrypting keyframes of video for secure surveillance applications.


Entropy ◽  
2020 ◽  
Vol 22 (2) ◽  
pp. 180 ◽  
Author(s):  
Dalia H. ElKamchouchi ◽  
Heba G. Mohamed ◽  
Karim H. Moussa

Modern multimedia communications technology requirements have raised security standards, which allows for enormous development in security standards. This article presents an innovative symmetric cryptosystem that depends on the hybrid chaotic Lorenz diffusion stage and DNA confusion stage. It involves two identical encryption and decryption algorithms, which simplifies the implementation of transmitting and receiving schemes of images securely as a bijective system. Both schemes utilize two distinctive non-consecutive chaotic diffusion stages and one DNA scrambling stage in between. The generation of the coded secret bit stream employs a hybrid chaotic system, which is employed to encrypt or decrypt the transmitted image and is utilized in the diffusion process to dissipate the redundancy in the original transmitted image statistics. The transmitted image is divided into eight scrambled matrices according to the position of the pixel in every splitting matrix. Each binary matrix is converted using a different conversion rule in the Watson–Crick rules. The DNA confusion stage is applied to increase the complexity of the correlation between the transmitted image and the utilized key. These stages allow the proposed image encryption scheme to be more robust against chosen/known plaintext attacks, differential attacks, cipher image attacks, and information entropy. The system was revealed to be more sensitive against minimal change in the generated secret key. The analysis proves that the system has superior statistical properties, bulkier key space, better plain text sensitivity, and improved key sensitivity compared with former schemes.


Author(s):  
Aarushi Shrivastava ◽  
Janki Ballabh Sharma ◽  
Sunil Dutt Purohit

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.


Author(s):  
Kan Chen ◽  
Bala Natarajan

Over the last decade, physical layer secret key generation (PHY-SKG) techniques that exploit reciprocity of wireless channels have attracted considerable interest among researchers in the field of wireless communication. Compared to traditional cryptographic methods, PHY-SKG techniques offer the following advantages: a computationally bounded adversary does not need to be assumed; PHY-SKG avoids the requirement of key management, and secret keys can be dynamically replenished. Additionally, PHY-SKG can enhance existing security schemes because it operates independently of higher layer security schemes. However, a key drawback of PHY-SKG is low secret key generation rate (SKGR), a critical performance metric. Therefore, the role of advanced network technologies (e.g., multiple input multiple output (MIMO) and cooperative MIMO) must be explored to enhance SKGR. This paper describes how MIMO and cooperative MIMO techniques can enhance SKGR.


Entropy ◽  
2019 ◽  
Vol 21 (1) ◽  
pp. 44 ◽  
Author(s):  
Sameh Askar ◽  
Abdel Karawia ◽  
Abdulrahman Al-Khedhairi ◽  
Fatemah Al-Ammar

In the literature, there are many image encryption algorithms that have been constructed based on different chaotic maps. However, those algorithms do well in the cryptographic process, but still, some developments need to be made in order to enhance the security level supported by them. This paper introduces a new cryptographic algorithm that depends on a logistic and two-dimensional chaotic economic map. The robustness of the introduced algorithm is shown by implementing it on several types of images. The implementation of the algorithm and its security are partially analyzed using some statistical analyses such as sensitivity to the key space, pixels correlation, the entropy process, and contrast analysis. The results given in this paper and the comparisons performed have led us to decide that the introduced algorithm is characterized by a large space of key security, sensitivity to the secret key, few coefficients of correlation, a high contrast, and accepted information of entropy. In addition, the results obtained in experiments show that our proposed algorithm resists statistical, differential, brute-force, and noise attacks.


2019 ◽  
Vol 2019 ◽  
pp. 1-15 ◽  
Author(s):  
Zhenjun Tang ◽  
Ye Yang ◽  
Shijie Xu ◽  
Chunqiang Yu ◽  
Xianquan Zhang

Image encryption is a useful technique of image content protection. In this paper, we propose a novel image encryption algorithm by jointly exploiting random overlapping block partition, double spiral scans, Henon chaotic map, and Lü chaotic map. Specifically, the input image is first divided into overlapping blocks and pixels of every block are scrambled via double spiral scans. During spiral scans, the start-point is randomly selected under the control of Henon chaotic map. Next, image content based secret keys are generated and used to control the Lü chaotic map for calculating a secret matrix with the same size of input image. Finally, the encrypted image is obtained by calculating XOR operation between the corresponding elements of the scrambled image and the secret matrix. Experimental result shows that the proposed algorithm has good encrypted results and outperforms some popular encryption algorithms.


2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Qiang Zhang ◽  
Xianglian Xue ◽  
Xiaopeng Wei

We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.


2012 ◽  
Vol 241-244 ◽  
pp. 2728-2731
Author(s):  
Yong Zhang

Some chaos-based image encryption schemes using plain-images independent secret code streams have weak encryption security and are vulnerable to chosen plaintext and chosen cipher-text attacks. This paper proposed a two-level secret key image encryption method, where the first-level secret key is the private symmetric secret key, and the second-level secret key is derived from both the first-level secret key and the plain image by iterating piecewise linear map and Logistic map. Even though the first-level key is identical, the different plain images will produce different second-level secret keys and different secret code streams. The results show that the proposed has high encryption speed, and also can effectively resist chosen/known plaintext attacks.


2018 ◽  
Vol 2018 ◽  
pp. 1-6 ◽  
Author(s):  
Hui Ren ◽  
Jun Wang ◽  
Qiong-Hua Wang

We introduce an image encryption method based on computer-generated hologram (CGH) and two-dimensional Sine Logistic modulation map (2D-SLMM). We combine CGH and 2D-SLMM to improve encryption security. During the encryption process, the hologram needs to be logistically modulated by 2D-SLMM. This logistic modulation technique can avoid complex algorithms. Simulation results and security analysis demonstrate that the proposed approach has a high security level, good invisibility of image information in ciphertext, large key space, and strong robustness.


2018 ◽  
Vol 2018 ◽  
pp. 1-24 ◽  
Author(s):  
Zeyu Liu ◽  
Tiecheng Xia ◽  
Jinbo Wang

A new fractional two-dimensional triangle function combination discrete chaotic map (2D-TFCDM) with the discrete fractional difference is proposed. We observe the bifurcation behaviors and draw the bifurcation diagrams, the largest Lyapunov exponent plot, and the phase portraits of the proposed map, respectively. On the application side, we apply the proposed discrete fractional map into image encryption with the secret keys ciphered by Menezes-Vanstone Elliptic Curve Cryptosystem (MVECC). Finally, the image encryption algorithm is analysed in four main aspects that indicate the proposed algorithm is better than others.


Sign in / Sign up

Export Citation Format

Share Document