Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
From MaRDI portal
Publication:6064475
DOI10.1016/j.ins.2021.02.012zbMath1527.68137OpenAlexW3131415921WikidataQ123021202 ScholiaQ123021202MaRDI QIDQ6064475
Enrico Formenti, Darij Grinberg, Luciano Margara, Alberto Dennunzio
Publication date: 9 November 2023
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.02.012
Data encryption (aspects in computer science) (68P25) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)
Related Items (3)
Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over \(\mathbb{Z}_p\) ⋮ An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption ⋮ An efficiently computable characterization of stability and instability for linear cellular automata
Cites Work
- Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
- Local rule distributions, language complexity and non-uniform cellular automata
- Three research directions in non-uniform cellular automata
- Computational complexity of finite asynchronous cellular automata
- Non-uniform cellular automata: classes, dynamics, and decidability
- Conservation of some dynamical properties for operations on cellular automata
- Sand automata as cellular automata
- A multisecret sharing scheme for color images based on cellular automata
- On the directional dynamics of additive cellular automata
- Linear cellular automata over \(Z_ m\)
- Algebraic properties of linear cellular automata
- Rice's theorem for the limit sets of cellular automata
- Solution of some conjectures about topological properties of linear cellular automata
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- Dynamical behavior of additive cellular automata over finite abelian groups
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- A secret sharing scheme based on cellular automata
- A Full Cellular Automaton to Simulate Predator-Prey Systems
- SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
- Communication Theory of Secrecy Systems*
- Languages, equicontinuity and attractors in cellular automata
- Computing Issues of Asynchronous CA
- Shorter Note: The Converse of Moore's Garden-of-Eden Theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
