An efficient image encryption scheme based on fractal Tromino and Chebyshev polynomial

33Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The security of digital content during transmission and storage through insecure communication links and databases is a challenging issue in today's world. In this article, an encryption scheme based on fractal Tromino and Chebyshev polynomial-based generated chaotic matrix is presented. The scheme fulfills the most fundamental aspect of encryption that is diffusion and confusion. For confusion highly non-linear, pre-defined S-boxes are used. The proposed scheme has been tested using state-of-the-art key performance indicators including differential analysis, statistical analysis. Information entropy analysis, mean square error, and NIST-based randomness analysis. The encrypted images have the highest practically achievable entropy of 7.999 and the time analysis shows that the proposed system is suitable for real-time implementation. The rest of the results indicates that the proposed cryptosystem possesses high immunity toward various attacks. The security analysis compared with the existing scheme shows the strength of the suggested scheme.

Cite

CITATION STYLE

APA

Khan, M., Alanazi, A. S., Khan, L. S., & Hussain, I. (2021). An efficient image encryption scheme based on fractal Tromino and Chebyshev polynomial. Complex and Intelligent Systems, 7(5), 2751–2764. https://doi.org/10.1007/s40747-021-00460-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free