Color Image Encryption Using Angular Graph Fourier Transform

Color Image Encryption Using Angular Graph Fourier Transform

Liuqing Yang, Wei Meng, Xudong Zhao
Copyright: © 2021 |Volume: 13 |Issue: 3 |Pages: 24
ISSN: 1941-6210|EISSN: 1941-6229|EISBN13: 9781799860365|DOI: 10.4018/IJDCF.20210501.oa5
Cite Article Cite Article

MLA

Yang, Liuqing, et al. "Color Image Encryption Using Angular Graph Fourier Transform." IJDCF vol.13, no.3 2021: pp.59-82. http://doi.org/10.4018/IJDCF.20210501.oa5

APA

Yang, L., Meng, W., & Zhao, X. (2021). Color Image Encryption Using Angular Graph Fourier Transform. International Journal of Digital Crime and Forensics (IJDCF), 13(3), 59-82. http://doi.org/10.4018/IJDCF.20210501.oa5

Chicago

Yang, Liuqing, Wei Meng, and Xudong Zhao. "Color Image Encryption Using Angular Graph Fourier Transform," International Journal of Digital Crime and Forensics (IJDCF) 13, no.3: 59-82. http://doi.org/10.4018/IJDCF.20210501.oa5

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this paper, an angular graph Fourier transform (AGFT) is introduced to encrypt color images with their intrinsic structures. The graph Fourier transform (GFT) is extended to the AGFT and proven to have the desired properties of angular transform and graph transform. In the proposed encryption method, color images are encoded by DNA sequences and confused under the control of chaotic key streams firstly. Secondly, sparse decomposition based on the random walk is applied to scramble pixels spatially, and a series of sub-images are obtained. This step increases encryption efficiency. Finally, the intrinsic sub-image structure is reflected by graphs, and the signals on different subgraphs are transformed into different AGFT domains with particular angular parameters, which makes the proposed method relevant to the original image structure and enhances security. The experimental results demonstrate that the proposed algorithm can resist various potential attacks and achieve better performance than the state-of-the-art algorithms.