A Modular Dynamical Cryptosystem Based on Continuous-Interval Cellular Automata
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
This paper presents a new cryptosystem based on chaotic continuous-interval cellular automata (CCA) to increase data protection as demonstrated by their flexibility to encrypt and decrypt information from distinct sources. Enhancements to cryptosystems are also presented including (i) a model based on a new chaotic CCA attractor, (ii) the dynamical integration of modules containing dynamical systems to generate complex sequences, and (iii) an enhancement for symmetric cryptosystems by allowing them to generate an unlimited number of keys. This paper also presents a process of mixing chaotic sequences obtained from cellular automata, instead of using differential equations, as a basis to achieve higher security and higher speed for the encryption and decryption processes, as compared to other recent approaches. The complexity of the mixed sequences is measured using the variance fractal dimension trajectory to compare them to the unmixed chaotic sequences to verify that the former are more complex. This type of polyscale measure and evaluation has never been done in the past outside this research group.
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.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.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