z-logo
open-access-imgOpen Access
A fractal‐based image encryption system
Author(s) -
AbdElHafiz Salwa Kamal,
Radwan Ahmed G.,
Abdel Haleem Sherif H.,
Barakat Mohamed L.
Publication year - 2014
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2013.0570
Subject(s) - encryption , disk encryption theory , histogram , fractal , nist , computer science , algorithm , cryptography , deterministic encryption , key (lock) , watermarking attack , image (mathematics) , theoretical computer science , artificial intelligence , mathematics , data mining , probabilistic encryption , attribute based encryption , public key cryptography , computer security , speech recognition , mathematical analysis
This study introduces a novel image encryption system based on diffusion and confusion processes in which the image information is hidden inside the complex details of fractal images. A simplified encryption technique is, first, presented using a single‐fractal image and statistical analysis is performed. A general encryption system utilising multiple fractal images is, then, introduced to improve the performance and increase the encryption key up to hundreds of bits. This improvement is achieved through several parameters: feedback delay, multiplexing and independent horizontal or vertical shifts. The effect of each parameter is studied separately and, then, they are combined to illustrate their influence on the encryption quality. The encryption quality is evaluated using different analysis techniques such as correlation coefficients, differential attack measures, histogram distributions, key sensitivity analysis and the National Institute of Standards and Technology (NIST) statistical test suite. The obtained results show great potential compared to other techniques.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here