scholarly journals A New Symmetric Image Encryption Scheme Based on Block Level Processing Using Hash Function and AES

2021 ◽  
Author(s):  
R. Thenmozhi ◽  
Sivaram Rajeyyagari ◽  
S. Balamuralitharan
Keyword(s):  
Image Encryption ◽  
Computational Time ◽  
Storage Space ◽  
Maximum Security ◽  
Computational Overhead ◽  
Important Concern ◽  
Hash Algorithm ◽  
Block Level ◽  
Secure Hash Algorithm ◽  
Audio Video

Data could be in many forms like text, image, audio, video and many others. Amongst these data, processing image is of important concern even with sophisticated technologies. Generally, images consume more storage space and processing time. This work aims in attaining a novel image encryption strategy that consumes very less computational time with maximum security. The idea is to split the image into blocks and rearrange the pixels in diagonal fashion to achieve confusion. Next, the blocks are combined to form sub images and one block of the sub image is subjected to Secure Hash Algorithm (SHA 512 bits). The SHA bits are XORed with the remaining blocks of the sub image. Finally, the entire image is encrypted using Advanced Encryption Standard (AES). Decryption process is the exact reverse of encryption process. The computational overhead is very low, and security is efficient. The results are compared with existing encryption techniques.

A novel chaos-based image encryption using DNA sequence operation and Secure Hash Algorithm SHA-2

2015 ◽  
Vol 83 (3) ◽  
pp. 1123-1136 ◽  
Author(s):  
R. Guesmi ◽  
M. A. B. Farah ◽  
A. Kachouri ◽  
M. Samet
Keyword(s):  
Dna Sequence ◽  
Image Encryption ◽  
Hash Algorithm ◽  
Secure Hash Algorithm

A chaotic image encryption scheme based on cat map and MMT permutation

2019 ◽  
Vol 33 (27) ◽  
pp. 1950326 ◽  
Author(s):  
Xingyuan Wang ◽  
Shujuan Lin ◽  
Yong Li
Keyword(s):  
Image Encryption ◽  
Security Analysis ◽  
Chaotic Sequence ◽  
Permutation Matrix ◽  
Encryption Algorithm ◽  
Encryption Scheme ◽  
Replacement Method ◽  
Hash Algorithm ◽  
The Matrix ◽  
Secure Hash Algorithm

This paper proposes an image encryption scheme based on cat mapping and matrix magic transformation (MMT) replacement method. First, the secure hash algorithm SHA-512 is used to generate 12 sets of keys, which are used for the initial values of the system and the required values of the algorithm for cat mapping and 2D-Logistic-adjusted-Sine map (LASM). Secondly, the plaintext image is scrambled by the cat mapping. Then, the matrix after the cat map replacement is again scrambled by the MMT replacement method to generate the permutation matrix. Finally, the permutation matrix is used for the bitxor operation with the chaotic sequence matrix generated by the 2D LASM system to realize the diffusion process of the scrambled image. Experimental results and security analysis show that the encryption algorithm has good performance and can resist various typical attacks.

scholarly journals A Dynamic DNA Color Image Encryption Method Based on SHA-512

Entropy ◽  
2020 ◽  
Vol 22 (10) ◽  
pp. 1091
Author(s):  
Shihua Zhou ◽  
Pinyan He ◽  
Nikola Kasabov
Keyword(s):  
Dna Sequencing ◽  
Image Encryption ◽  
Chaotic Systems ◽  
Color Image ◽  
Brute Force ◽  
Chaotic Sequences ◽  
Initial Values ◽  
Hash Algorithm ◽  
Secure Hash Algorithm ◽  
Encryption Method

This paper presents a dynamic deoxyribonucleic acid (DNA) image encryption based on Secure Hash Algorithm-512 (SHA-512), having the structure of two rounds of permutation–diffusion, by employing two chaotic systems, dynamic DNA coding, DNA sequencing operations, and conditional shifting. We employed the SHA-512 algorithm to generate a 512-bit hash value and later utilized this value with the natural DNA sequence to calculate the initial values for the chaotic systems and the eight intermittent parameters. We implemented a two-dimensional rectangular transform (2D-RT) on the permutation. We used four-wing chaotic systems and Lorentz systems to generate chaotic sequences and recombined three channel matrices and chaotic matrices with intermittent parameters. We calculated hamming distances of DNA matrices, updated the initial values of two chaotic systems, and generated the corresponding chaotic matrices to complete the diffusion operation. After diffusion, we decoded and decomposed the DNA matrices, and then scrambled and merged these matrices into an encrypted image. According to experiments, the encryption method in this paper not only was able to withstand statistical attacks, plaintext attacks, brute-force attacks, and a host of other attacks, but also could reduce the complexity of the algorithm because it adopted DNA sequencing operations that were different from traditional DNA sequencing operations.

scholarly journals Data De-Duplication Using SHA (Secure Hash Algorithm)

2019 ◽  
pp. 01-05
Author(s):  
G. Kalyani ◽  
D.S.L. Neethika ◽  
Ch. Jayasri
Keyword(s):  
Cloud Storage ◽  
Storage Space ◽  
Data Deduplication ◽  
Redundant Data ◽  
Hash Algorithm ◽  
Secure Hash Algorithm ◽  
Exponential Rates

Now-a-days the number of users using cloud storage has increased so that the data stored has been increased in exponential rates. The data should be secured and the storage should be used efficiently. But a lot of duplicate data is present as two or more users may upload the same data. To make use of the cloud storage efficiently we have to reduce the redundant data hence improving the resources like storage space, disk I/O operations of the cloud vendors. Data De-Duplication is the process to remove redundant data and store only one instance of duplicate data. The objective of the proposed system is to increase the efficient comparison of hash values of a different data blocks and security of data. This paper includes a method for data deduplication using SHA (Secure Hash Algorithm) and AES. SHA is used as it is more secure than other hashing algorithms. The data is encrypted using AES at owner machine itself and using SHA the redundant data will be eliminated.

scholarly journals Privacy Preserving Machine Learning with Homomorphic Encryption and Federated Learning

2021 ◽  
Vol 13 (4) ◽  
pp. 94
Author(s):  
Haokun Fang ◽  
Quan Qian
Keyword(s):  
Machine Learning ◽  
Homomorphic Encryption ◽  
Privacy Preserving ◽  
Great Success ◽  
Learning Framework ◽  
Computational Overhead ◽  
Important Concern ◽  
Speed Up ◽  
Key Length ◽  
Core Idea

Privacy protection has been an important concern with the great success of machine learning. In this paper, it proposes a multi-party privacy preserving machine learning framework, named PFMLP, based on partially homomorphic encryption and federated learning. The core idea is all learning parties just transmitting the encrypted gradients by homomorphic encryption. From experiments, the model trained by PFMLP has almost the same accuracy, and the deviation is less than 1%. Considering the computational overhead of homomorphic encryption, we use an improved Paillier algorithm which can speed up the training by 25–28%. Moreover, comparisons on encryption key length, the learning network structure, number of learning clients, etc. are also discussed in detail in the paper.

scholarly journals An Effective Framework for Chaotic Image Encryption Based on 3D Logistic Map

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Guodong Ye ◽  
Kaixin Jiao ◽  
Chen Pan ◽  
Xiaoling Huang
Keyword(s):  
Chaotic Map ◽  
Logistic Map ◽  
Security Analysis ◽  
Three Dimensional ◽  
Ecg Signal ◽  
Hash Algorithm ◽  
Plain Image ◽  
Secure Hash Algorithm ◽  
Low Sensitivity ◽  
Encryption Method

In this paper, an effective framework for chaotic encryption based on a three-dimensional logistic map is presented together with secure hash algorithm-3 (SHA-3) and electrocardiograph (ECG) signal. Following the analysis of the drawbacks, namely, fixed key and low sensitivity, of some current algorithms, this work tries to solve these two problems and includes two contributions: (1) removal of the phenomenon of summation invariance in a plain-image, for which SHA-3 is proposed to calculate the hash value for the plain-image, with the results being employed to influence the initial keys for chaotic map; (2) resolution of the problem of fixed key by using an ECG signal, that can be different for different subjects or different for same subject at different times. The Wolf algorithm is employed to produce all the control parameters and initial keys in the proposed encryption method. It is believed that combining with the classical architecture of permutation-diffusion, the summation invariance in the plain-image and shortcoming of a fixed key will be avoided in our algorithm. Furthermore, the experimental results and security analysis show that the proposed encryption algorithm can achieve confidentiality.

scholarly journals SHAvisual: A Visualization Tool for the Secure Hash Algorithm

2015 ◽  
Author(s):  
Ching-Kuang Shene ◽  
Chaoli Wang ◽  
Jun Tao ◽  
Melissa Keranen ◽  
Jun Ma ◽  
...  
Keyword(s):  
Visualization Tool ◽  
Hash Algorithm ◽  
Secure Hash Algorithm
Sign in / Sign up

Export Citation Format

Share Document