A new multiple image encryption algorithm using hyperchaotic systems, SVD, and modified RC5
Bibliographic record
Abstract
Secure image encryption is critical for protecting sensitive data such as satellite imagery, which is pivotal for national security and environmental monitoring. However, existing encryption methods often face challenges such as vulnerability to traffic analysis, limited randomness, and insufficient resistance to attacks. To address these gaps, this article proposes a novel multiple image encryption (MIE) algorithm that integrates hyperchaotic systems, Singular Value Decomposition (SVD), counter mode RC5, a chaos-based Hill cipher, and a custom S-box generated via a modified Blum Blum Shub (BBS) algorithm. The proposed MIE algorithm begins by merging multiple satellite images into an augmented image, enhancing security against traffic analysis. The encryption process splits the colored image into RGB channels, with each channel undergoing four stages: additive confusion using a memristor hyperchaotic key transformed by SVD, RC5 encryption in counter mode with XOR operations, Hill cipher encryption using a 6D hyperchaotic key and invertible matrices mod 256, and substitution with a custom S-box generated by a modified BBS. Experimental results demonstrate the proposed algorithm's superior encryption efficiency, enhanced randomness, and strong resistance to cryptanalytic, differential, and brute-force attacks. These findings highlight the MIE algorithm's potential for securing satellite imagery in real-time applications, ensuring confidentiality and robustness against modern security threats.
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.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".