Reversible cellular automata with memory of delay type

Complexity ◽  
2014 ◽  
Vol 20 (1) ◽  
pp. 49-56 ◽  
Author(s):  
Ramón Alonso-Sanz
Keyword(s):  
Cellular Automata ◽  
Reversible Cellular Automata ◽  
With Memory

Phase Transition in Elementary Cellular Automata with Memory

2014 ◽  
Vol 24 (09) ◽  
pp. 1450116 ◽  
Author(s):  
Shigeru Ninagawa ◽  
Andrew Adamatzky ◽  
Ramón Alonso-Sanz
Keyword(s):  
Cellular Automata ◽  
State Transition ◽  
Time Interval ◽  
Complex Behavior ◽  
Weighted Function ◽  
Transition Functions ◽  
Elementary Cellular Automata ◽  
Computational Universality ◽  
With Memory ◽  
Time Automaton

We study elementary cellular automata with memory. The memory is a weighted function averaged over cell states in a time interval, with a varying factor which determines how strongly a cell's previous states contribute to the cell's present state. We classify selected cell-state transition functions based on Lempel–Ziv compressibility of space-time automaton configurations generated by these functions and the spectral analysis of their transitory behavior. We focus on rules 18, 22, and 54 because they exhibit the most intriguing behavior, including computational universality. We show that a complex behavior is observed near the nonmonotonous transition to null behavior (rules 18 and 54) or during the monotonic transition from chaotic to periodic behavior (rule 22).

scholarly journals BLOCK CIPHERS ON THE BASIS OF REVERSIBLE CELLULAR AUTOMATA

2020 ◽  
Vol 10 (1) ◽  
pp. 8-11
Author(s):  
Yuliya Tanasyuk ◽  
Petro Burdeinyi
Keyword(s):  
Cellular Automata ◽  
Block Cipher ◽  
Key Generation ◽  
One Dimensional ◽  
C Programming Language ◽  
C Programming ◽  
Shared Secret ◽  
Reversible Cellular Automata ◽  
The Given ◽  
First Time

The given paper is devoted to the software development of block cipher based on reversible one-dimensional cellular automata and the study of its statistical properties. The software implementation of the proposed encryption algorithm is performed in C# programming language in Visual Studio 2017. The paper presents specially designed approach for key generation. To ensure desired cryptographic stability, the shared secret parameters can be adjusted to contain information needed for creating substitution tables, defining reversible rules, and hiding final data. For the first time, it is suggested to create substitution tables based on iterations of a cellular automaton that is initialized by the key data.

Sign in / Sign up

Export Citation Format

Share Document