A Chaos-Based Image Encryption Scheme Using the Hamming Distance and DNA Sequence Operation
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this study, we introduced a new memristive chaotic system with the rich dynamic behavior, and then we proposed a chaotic-based image encryption scheme which is based on the permutation–confusion–substitution structure. In our scheme, the Hamming distance is used to design a plain-related chaotic system initial condition, and the generated chaotic sequences are assigned to permutation, diffusion, and substitution stages. In the permutation stage, an effect pixel confusion is implemented through a new permutation approach, which is a double-ended select-swap scrambling strategy. In the diffusion stage, DNA XOR operation is implemented followed by DNA triploid mutation which is introduced to enhance the strength of our encryption system. A number of experiments and extensive safety analysis have been carried out and the results fully justify that our scheme not only ensures desirable security but also has superior efficiency.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it