Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

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

Version 1 : Received: 3 July 2021 / Approved: 5 July 2021 / Online: 5 July 2021 (18:42:36 CEST)

How to cite: Thenmozhi, R.; Rajeyyagari, S.; Balamuralitharan, S. A New Symmetric Image Encryption Scheme Based on Block Level Processing Using Hash Function and AES. Preprints 2021, 2021070121 (doi: 10.20944/preprints202107.0121.v1). Thenmozhi, R.; Rajeyyagari, S.; Balamuralitharan, S. A New Symmetric Image Encryption Scheme Based on Block Level Processing Using Hash Function and AES. Preprints 2021, 2021070121 (doi: 10.20944/preprints202107.0121.v1).

Abstract

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.

Subject Areas

Encryption; Decryption; Security; SHA; AES

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.