scholarly journals Keyed Parallel Hash Algorithm Based on Multiple Chaotic Maps (KPHA-MCM)

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Roayat Ismail Abdelfatah ◽  
B. Esraa Abdelkhalek ◽  
Mohamed E. Nasr
2013 ◽  
Vol 325-326 ◽  
pp. 1502-1507 ◽  
Author(s):  
Xuan Fang ◽  
Cai Qiong ◽  
Lan Fang

Due to the single chaotic map on finite precisions chaotic characteristics emerge degradation,the length of cycle become shorter, the Hash algorithm constructed by it is easily forecast, the security is not strong.In this paper, the nonlinear devices in the traditional block cipher S-box is used to construct variable parameters Hash algorithm composed of multiple chaotic maps. By using the original message, intermediate values of iteration and number of iterations as the input of the S-box, output of S-box is used to determine the parameters of chaotic maps, on this account to change the chaotic mapping function for each round. By execute text testing, statistical analysis and collision analysis for this algorithm through simulation experiments, the experimental results show that this generalized chaotic Hash algorithm has good sensitivity of the information, low possibility of collision,good safety and operational efficiency.


Informatics ◽  
2020 ◽  
Vol 17 (1) ◽  
pp. 109-118
Author(s):  
A. V. Sidorenko ◽  
M. S. Shishko

New hashing technique based on SHA-3 (Secure Hash Algorithm-3) is introduced. Chaotic maps are used in this technique to enhance performance without losing security. Introduced algorithm was tested for        resistance against collisions, statistical analysis of output sequences was performed, hashing performance was evaluated. The testing showed a low collision probability. The testing corresponds the standards of National Institute of Standards and Technology and showed that output sequences are close to random. Performance testing showed 60 % enhancement in comparison with plain SHA-3.


2018 ◽  
Vol 8 (10) ◽  
pp. 1963 ◽  
Author(s):  
◽  
Jun Sang ◽  
Muhammad Azeem Akbar ◽  
Bin Cai ◽  
Hong Xiang ◽  
...  

Confidentiality and efficient bandwidth utilization require a combination of compression and encryption of digital images. In this paper, a new method for joint image compression and encryption based on set partitioning in hierarchical trees (SPIHT) with optimized Kd-tree and multiple chaotic maps was proposed. First, the lossless compression and encryption of the original images were performed based on integer wavelet transform (IWT) with SPIHT. Wavelet coefficients undergo diffusions and permutations before encoded through SPIHT. Second, maximum confusion, diffusion and compression of the SPIHT output were performed via the modified Kd-tree, wavelet tree and Huffman coding. Finally, the compressed output was further encrypted with varying parameter logistic maps and modified quadratic chaotic maps. The performance of the proposed technique was evaluated through compression ratio (CR) and peak-signal-to-noise ratio (PSNR), key space and histogram analyses. Moreover, this scheme passes several security tests, such as sensitivity, entropy and differential analysis tests. According to the theoretical analysis and experimental results, the proposed method is more secure and decreases the redundant information of the image more than the existing techniques for hybrid compression and encryption.


2013 ◽  
Vol 13 (2) ◽  
pp. 75-81 ◽  
Author(s):  
Bhagwati Prasad ◽  
Kunti Mishra

Abstract The intent of this paper is to propose an encryption compression scheme using multiple chaotic maps along with the concept of Galois field. This method improves the security of the encrypted data and a significant compression is also achieved. The obtained high security architectures are ideal for many real life applications such as medical images, legal documents and military and other operation


3D Research ◽  
2017 ◽  
Vol 8 (2) ◽  
Author(s):  
Musheer Ahmad ◽  
Shruti Khurana ◽  
Sushmita Singh ◽  
Hamed D. AlSharari

Sign in / Sign up

Export Citation Format

Share Document