MétaCan
Menu
Back to cohort
Record W4416673321 · doi:10.1007/s44443-025-00341-7

Image encryption method based on small-world coupled mapping lattice and entropy extraction of cellular automata

2025· article· en· W4416673321 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of King Saud University - Computer and Information Sciences · 2025
Typearticle
Languageen
FieldComputer Science
TopicChaos-based Image/Signal Encryption
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsEncryptionKeystreamCellular automatonScramblingPlaintextModuloPixelLearning with errorsEntropy (arrow of time)

Abstract

fetched live from OpenAlex

This paper proposes an image encryption algorithm based on small-world coupled mapping lattice and cellular automata. First, the initial parameters are jointly derived using the key and plaintext to drive the CML to evolve under the red–black update, and the key stream and mask are adaptively generated by ECA and local entropy. Reversible mixing is achieved through scrambling and channel integer shearing + modulo 1 expansion. Subsequently, deterministic CFB diffusion and byte-level DNA substitution are performed to obtain the ciphertext. Decryption is precisely restored in the reverse process. Experiments on standard images show that this method achieves nearly uniform histograms, high pixel entropy, strong key sensitivity, and can resist common attacks such as noise and cropping. This framework is user-friendly, easy to parallelize and has strict security attributes.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.904
Threshold uncertainty score0.385

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.005
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.014
GPT teacher head0.251
Teacher spread0.236 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it