Innovative Quantum Encryption Method for RGB Images Based on Bit-Planes and Logistic Maps
Bibliographic record
Abstract
This study presents a novel encryption method for RGB (Red–Green–Blue) color images that combines scrambling techniques with the logistic map equation. In this method, image scrambling serves as a reversible transformation, rendering the image unintelligible to unauthorized users and thus enhancing security against potential attacks. The proposed encryption scheme, called Bit-Plane Representation of Quantum Images (BRQI), utilizes quantum operations in conjunction with a one-dimensional chaotic system to increase encryption efficiency. The encryption algorithm operates in two phases: first, the quantum image undergoes scrambling through bit-plane manipulation, and second, the scrambled image is mixed with a key image generated using the logistic map. To assess the performance of the algorithm, simulations and analyses were conducted, evaluating parameters such as entropy (a measure of disorder) and correlation coefficients to confirm the effectiveness and robustness of this algorithm in safeguarding and encoding color images. The results show that the proposed quantum color image encryption algorithm surpasses classical methods in terms of security, robustness, and computational complexity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".