A sector fast encryption algorithm for color images based on one-dimensional composite sinusoidal chaos map.

Bibliographic Details
Title: A sector fast encryption algorithm for color images based on one-dimensional composite sinusoidal chaos map.
Authors: Tao, Ye1,2,3 (AUTHOR), Cui, Wenhua1,2,3 (AUTHOR) taibeijack@126.com, Wang, Shanshan4 (AUTHOR), Wang, Yayun5,6 (AUTHOR)
Source: PLoS ONE. 1/24/2025, Vol. 20 Issue 1, p1-56. 56p.
Subject Terms: *DATA encryption, *CHAOS theory, *ENTROPY (Information theory), *ALGORITHMS, *PIXELS, *IMAGE encryption
Abstract: Images are important information carriers in our lives, and images should be secure when transmitted and stored. Image encryption algorithms based on chaos theory emerge in endlessly. Based on previous various chaotic image fast encryption algorithms, this paper proposes a color image sector fast encryption algorithm based on one-dimensional composite sinusoidal chaotic mapping. The main purpose of this algorithm is to improve the encryption and decryption speed of color images and improve the efficiency of image encryption in the big data era. First, four basic chaos maps are combined in pairs and added with sine operations. Six one-dimensional composite sinusoidal chaos maps (CSCM) were obtained. Secondly, select the two best chaotic mappings LCS and SCS. The randomness of these two chaotic mappings was verified through Lyapunov index and NIST SP 800–22 randomness tests. Thirdly, the encryption process is carried out according to the shape of a traditional Chinese fan, and the diffusion and scrambling of each pixel of the image are performed in parallel. This greatly improves encryption speed. When diffusing, changing the value of one pixel can affect the values of multiple subsequent pixels. When scrambling, each pixel changes position with the three pixels before it according to the chaotic sequence. Finally, through many experiments, it is proved that the image encryption algorithm not only greatly improves the encryption and decryption speed, but also improves various indexes. The key space reached 2192, the average information entropy was 7.9994, the average NPCR was 99.6172, and the average UACI was 33.4646. The algorithm can also resist some common attacks and accidents, such as exhaustion attack, differential attack, noise attack, information loss and so on. [ABSTRACT FROM AUTHOR]
Copyright of PLoS ONE is the property of Public Library of Science and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Academic Search Complete
Full text is not displayed to guests.
More Details
ISSN:19326203
DOI:10.1371/journal.pone.0310279
Published in:PLoS ONE
Language:English