ArticlePloS one2025
A sector fast encryption algorithm for color images based on one-dimensional composite sinusoidal chaos map.
Article in PloS one, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
No grant is acknowledged in the PubMed record.
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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.