ArticlePloS one2024
FOPBIE: Multi-image cipher based on the random walk of fleet of pawns on the large hypothetical chessboard and chaotic system.
Article in PloS one, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.
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
2 citing papers in PubMed.
- A new multiple image encryption algorithm using hyperchaotic systems, SVD, and modified RC5.Scientific reports · 2025Article
- Enhancing AES image encryption with a three-dimensional hyperchaotic system for increased security and efficiency.PloS one · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
In the last two decades or so, a large number of image ciphers have been written. The majority of these ciphers encrypt only one image at a time. Few image ciphers were written which could encrypt multiple images in one session. The current era needs speedy multiple image ciphers to address its varied needs in different settings. Motivated by this dictation, the current study has ventured to write a multi-image cipher based on the fleet of pawns walking in the large hypothetical chessboard. This walk of pawns on the chessboard has been ingeniously linked with transferring the pixels from the plain image to the scrambled image. The confusion effects have been realized through the XOR operation between the scrambled image and the key image. The plaintext sensitivity has been incorporated by embedding the SHA-384 hash codes of the given large combined plain image. Moreover, the Henon map has been employed to spawn the streams of random numbers. Besides, Blum Blum Shub random number generator has been used to further cement the security of the proposed cipher. We got a computational time of 0.2278 seconds and an encryption throughput of 5.5782 MBit/seconds by using the four images with a size of 256×256. Apart from that, the information entropy gained is 7.9993. Lastly, the cipher has been subjected to an array of validation metrics to demonstrate its aversion to the myriad threats from the cryptanalysis savvy. We contend that the proposed work has great potential for some real-world applications.
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.