An efficient algorithm deciding chaos for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\) with applications to data encryption

DOI10.1016/j.ins.2023.119942OpenAlexW4389080856MaRDI QIDQ6179977

Alberto Dennunzio, Luciano Margara, Enrico Formenti

Publication date: 18 January 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2023.119942

zbMATH Keywords

chaoscellular automatadata encryptionlinear cellular automata

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear cellular automata over \(Z_ m\)
• Algebraic properties of linear 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
• A secret sharing scheme based on cellular automata
• Chaos and ergodicity are decidable for linear cellular automata over \((\mathbb{Z}/m\mathbb{Z})^n\)
• SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
• Decidable characterizations of dynamical properties for additive cellular automata over a finite abelian group with applications to data encryption

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