Quick Search:

A time-efficient and noise-resistant cryptosystem based on discrete wavelet transform and chaos theory: An application in image encryption

Mehmood, Abid, Shafique, Arslan, Chaudhry, Shehzad Ashraf, Alawida, Moatsum, Khan, Abdul Nasir ORCID: https://orcid.org/0000-0001-9742-1669 and Kumar, Neeraj (2023) A time-efficient and noise-resistant cryptosystem based on discrete wavelet transform and chaos theory: An application in image encryption. Journal of Information Security and Applications, 78. p. 103590.

Full text not available from this repository.


Over the past few years, there has been a rise in the utilization of chaotic encryption algorithms for securing images. The majority of chaos-based encryption algorithms adhere to the conventional model of confusion and diffusion, which typically involves either implementing multiple encryption rounds or employing a single round of intricate encryption to guarantee robust security. However, such kind of approaches reduces the computational efficiency of the encryption process but compromises security. There is a trade-off between security and computational efficiency. Prioritizing security may require high computational processes. To overcome this issue, a key substitution encryption process with discrete wavelet transform (KSP-DWT) is developed in the proposed image encryption technique (IET). Based on KSP-DWT and IET, the abbreviation of the proposed work is used in this paper as KSP-DWT-IET. The proposed KSP-DWT algorithm employs a key scheming technique to update the initial keys and uses a novel substitution method to encrypt digital images of different sizes. Additionally, the integration of DWT can result in the compression of frequency sub-bands of the source image, leading to lower computational overheads without compromising the security of the encryption. The KSP-DWT-IET performs a single encryption round and is highly secure and efficient. The simulation results and security analysis conducted on KSP-DWT-IET confirm its effectiveness in ensuring high-security image encryption while minimizing computational overhead. The proposed encryption technique undergoes various security analyses, including entropy, contrast, correlation, energy, NPCR (Number of Pixel Changes Rate), UACI (Unified Average Change Intensity) and computational complexity. The statistical values obtained for such parameters are 7.9991, 10.9889, 0.0001, 0.0152, 33.6767, and 33.6899, respectively, which indicate that the encryption technique performs very well in terms of security and computational efficiency. The proposed encryption scheme is also analyzed for its computational time in addition to its security. The analysis shows that the scheme can efficiently encrypt images of varying sizes with a high level of security in a short amount of time (i.e., 2 ms). Therefore, it is feasible to use this encryption scheme in real-time applications without causing any significant delays. Moreover, the key space of the proposed encryption scheme is large enough (i.e. Keyspace >2 100) to resist the brute force attack.

Item Type: Article
Status: Published
DOI: https://doi.org/10.1016/j.jisa.2023.103590
School/Department: School of Science, Technology and Health
SWORD Depositor: Jisc Publication Router
URI: https://ray.yorksj.ac.uk/id/eprint/8654

University Staff: Request a correction | RaY Editors: Update this record