An efficient algorithm deciding chaos for linear cellular automata over (Z/mZ)^n with applications to data encryption
From MaRDI portal
Publication:6179977
Cites work
- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over \(Z_{m}\)
- A secret sharing scheme based on cellular automata
- Algebraic properties of linear cellular automata
- Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
- Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption
- Dynamical behavior of additive cellular automata over finite abelian groups
- scientific article; zbMATH DE number 44378 (Why is no real title available?)
- scientific article; zbMATH DE number 1500511 (Why is no real title available?)
- scientific article; zbMATH DE number 3440338 (Why is no real title available?)
- Linear cellular automata over \(Z_ m\)
- Solution of some conjectures about topological properties of linear cellular automata
- SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
Cited in
(2)
This page was built for publication: An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179977)