An Image Encryption Algorithm with Hermite Chaotic Polynomials and Scan Pattern

In today's digital world, massive amount of sensitive information is being generated in the form of image and further it is shared via Internet. Maintaining the confidentiality of these data has become a major issue due to security vulnerability present in the network and transmission media. Im...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2021-02, Vol.1767 (1), p.12044
Main Authors: Sivakumar, T., Pandi, M., Senthil Madasamy, N., Bharathi, R.
Format: Article
Language:English
Subjects:
Algorithms
Encryption
Hermite polynomials
Image transmission
Physics
Pixels
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In today's digital world, massive amount of sensitive information is being generated in the form of image and further it is shared via Internet. Maintaining the confidentiality of these data has become a major issue due to security vulnerability present in the network and transmission media. Image encryption algorithms are developed by various researchers to permit only authorized users to access and view sensitive images. This paper presents a novel image encryption scheme based on Hermite polynomials chaos function. First, random key stream is generated by using Hermite polynomial with different initial and incremental values of the variables. Next, the original image is scrambled with scan pattern to rearrange the pixels position. The scrambled image is XORed with the random key stream to get the encrypted image. The proposed method is experimented and observed that it is efficient and confirms the confusion and diffusion properties of a secure image encryption method. Large key space, low relation between the pixels of encrypted image, and sensitivity to initial seed value of the key are the strength of the proposed image encryption method.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1767/1/012044