A chaos-based image encryption algorithm with simple logical functions
•Proposed an effective chaotic encryption scheme based on confusion and diffusion principles.•Introduced bitwise circular rotation operation to increase plaintext sensitivity.•Proposed an effective encryption scheme with two independent chaotic functions to increase computing ability.•Test results i...
Saved in:
Published in | Computers & electrical engineering Vol. 54; pp. 471 - 483 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier Ltd
01.08.2016
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | •Proposed an effective chaotic encryption scheme based on confusion and diffusion principles.•Introduced bitwise circular rotation operation to increase plaintext sensitivity.•Proposed an effective encryption scheme with two independent chaotic functions to increase computing ability.•Test results indicate that the proposed encryption method is more secure and fast.
[Display omitted]
This paper proposes an effective chaos-based encryption algorithm specialised for images. A system of two independent chaotic functions with high sensitivity to initial states, is utilised to sufficiently apply confusion and diffusion principles for images with any entropy. One of the functions is used for shuffling pixel positions while the other for changing the values of pixels. In the resulting new pixel organisation, adjacent pixels with naturally close values will take on considerably different values, making it difficult to crack the encrypted image. To increase resistance of the system to differential attacks, some logical operations such as exclusive-or and circular rotation are used to spread the effect of a slight change in single pixel intensity of plain image over many pixels in cipher-image. A variety of analyses and tests has been carried out to prove the security and the validity of the algorithm. Even with low entropy images the proposed algorithm has been proved to be more secure and faster than the previous algorithms. |
---|---|
ISSN: | 0045-7906 1879-0755 |
DOI: | 10.1016/j.compeleceng.2015.11.008 |