arXiv subjects

Jan M. Baetens

Publications and source records attributed to Jan M. Baetens.

22 records · Page 2Linked to original sources

arXiv2015

Introducing Lyapunov profiles of cellular automata

In line with the stability theory of continuous dynamical systems, Lyapunov exponents of cellular automata (CAs) have been conceived two decades ago to quantify to what extent their dynamics changes following a perturbation of their initial configuration. More precisely, Lyapunov exponents of CAs have either been understood as the rate by which the resulting defect cone widens as these dynamical systems are evolved from a perturbed initial configuration, or as the rate by which defects accumulate during their evolution. The former viewpoint yields insight into the extent of the affected region, whereas the latter tells us something about the intensity of the defect propagation. In this paper, we will show how these viewpoints can be united by relying on Lyapunov profiles of CAs.

math.DS↗

arXiv2015

An evolutionary approach to the identification of Cellular Automata based on partial observations

In this paper we consider the identification problem of Cellular Automata (CAs). The problem is defined and solved in the context of partial observations with time gaps of unknown length, i.e. pre-recorded, partial configurations of the system at certain, unknown time steps. A solution method based on a modified variant of a Genetic Algorithm (GA) is proposed and illustrated with brief experimental results.

cs.NE↗

arXiv2015

On the decomposition of stochastic cellular automata

In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. images that show the average state of each cell during the evolution of the stochastic cellular automaton. The second property shows that stochastic cellular automata are equivalent to so-called stochastic mixtures of deterministic cellular automata. Based on this property, any stochastic cellular automaton can be decomposed into a set of deterministic cellular automata, each of which contributes to the behavior of the stochastic cellular automaton.

cs.FL↗

arXiv2015

A dynamical systems approach to the discrimination of the modes of operation of cryptographic systems

Evidence of signatures associated with cryptographic modes of operation is established. Motivated by some analogies between cryptographic and dynamical systems, in particular with chaos theory, we propose an algorithm based on Lyapunov exponents of discrete dynamical systems to estimate the divergence among ciphertexts as the encryption algorithm is applied iteratively. The results allow to distinguish among six modes of operation, namely ECB, CBC, OFB, CFB, CTR and PCBC using DES, IDEA, TEA and XTEA block ciphers of 64 bits, as well as AES, RC6, Twofish, Seed, Serpent and Camellia block ciphers of 128 bits. Furthermore, the proposed methodology enables a classification of modes of operation of cryptographic systems according to their strength.

cs.CR↗