A novel image encryption based on hash function with only two-round diffusion process

被引:138
作者
Norouzi, Benyamin [1 ]
Seyedzadeh, Seyed Mohammad [1 ]
Mirzakuchaki, Sattar [1 ]
Mosavi, Mohammad Reza [1 ]
机构
[1] Iran Univ Sci & Technol, Sch Elect Engn, Tehran 1684613114, Iran
关键词
Image encryption; Salsa20 hash function; Diffusion process; Security; Sensitivity; ALGORITHM; SCHEME; CRYPTANALYSIS; SYSTEM;
D O I
10.1007/s00530-013-0314-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a novel algorithm for image encryption based on hash function is proposed. In our algorithm, a 512-bit long external secret key is used as the input value of the salsa20 hash function. First of all, the hash function is modified to generate a key stream which is more suitable for image encryption. Then the final encryption key stream is produced by correlating the key stream and plaintext resulting in both key sensitivity and plaintext sensitivity. This scheme can achieve high sensitivity, high complexity, and high security through only two rounds of diffusion process. In the first round of diffusion process, an original image is partitioned horizontally to an array which consists of 1,024 sections of size 8 x 8. In the second round, the same operation is applied vertically to the transpose of the obtained array. The main idea of the algorithm is to use the average of image data for encryption. To encrypt each section, the average of other sections is employed. The algorithm uses different averages when encrypting different input images (even with the same sequence based on hash function). This, in turn, will significantly increase the resistance of the cryptosystem against known/chosen-plaintext and differential attacks. It is demonstrated that the 2D correlation coefficients (CC), peak signal-to-noise ratio (PSNR), encryption quality (EQ), entropy, mean absolute error (MAE) and decryption quality can satisfy security and performance requirements (CC < 0.002177, PSNR < 8.4642, EQ > 204.8, entropy > 7.9974 and MAE > 79.35). The number of pixel change rate (NPCR) analysis has revealed that when only one pixel of the plain-image is modified, almost all of the cipher pixels will change (NPCR > 99.6125 %) and the unified average changing intensity is high (UACI > 33.458 %). Moreover, our proposed algorithm is very sensitive with respect to small changes (e.g., modification of only one bit) in the external secret key (NPCR > 99.65 %, UACI > 33.55 %). It is shown that this algorithm yields better security performance in comparison to the results obtained from other algorithms.
引用
收藏
页码:45 / 64
页数:20
相关论文
共 61 条
[1]   A novel scheme for image encryption based on 2D piecewise chaotic maps [J].
Akhshani, A. ;
Behnia, S. ;
Akhavan, A. ;
Abu Hassan, H. ;
Hassan, Z. .
OPTICS COMMUNICATIONS, 2010, 283 (17) :3259-3266
[2]   New approach to chaotic encryption [J].
Alvarez, E ;
Fernández, A ;
García, P ;
Jiménez, J ;
Marcano, A .
PHYSICS LETTERS A, 1999, 263 (4-6) :373-375
[3]   Cryptanalysis of a chaotic encryption system [J].
Alvarez, G ;
Montoya, F ;
Romera, M ;
Pastor, G .
PHYSICS LETTERS A, 2000, 276 (1-4) :191-196
[4]  
[Anonymous], 2016, HDB APPL CRYPTOGRAPH
[5]  
[Anonymous], 1995, FDN CRYPTOGRAPHY
[6]   A novel algorithm for image encryption based on mixture of chaotic maps [J].
Behnia, S. ;
Akhshani, A. ;
Mahmodi, H. ;
Akhavan, A. .
CHAOS SOLITONS & FRACTALS, 2008, 35 (02) :408-419
[7]   A fast chaotic encryption scheme based on piecewise nonlinear chaotic maps [J].
Behnia, S. ;
Akhshani, A. ;
Ahadpour, S. ;
Mahmodi, H. ;
Akhavan, A. .
PHYSICS LETTERS A, 2007, 366 (4-5) :391-396
[8]  
Belkhouche F., 2003, P IEEE ANN TECHN C, P39
[9]  
Bernstein D., SALSA20 SECURITY
[10]  
Bernstein D. J., 2005, Salsa20 specification