Related papers: A 10-bit S-box generated by Feistel construction f…
A subset of 10 of the 256 elementary cellular automata (ECA) are implemented as a hash function using an error minimization lossy compression algorithm operating on wrapped 4x4 neighborhood cells. All 256 rules are processed and 10 rules in…
The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns or gliders that interact in a periodic…
We present a generator of virtual molecules that selects valid chemistry on the basis of the octet rule. Also, we introduce a mesomer group key that allows a fast detection of duplicates in the generated structures. Compared to existing…
In coding theory, codes are usually designed with a certain level of randomness to facilitate analysis and accommodate different channel conditions. However, the resulting random code constructed can be suboptimal in practical…
Let L:= Z^D be the D-dimensional lattice and let A^L be the Cantor space of L-indexed configurations in some finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F of A^L,…
A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of x= cot2(x). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract…
From dice to modern complex circuits, there have been many attempts to build increasingly better devices to generate random numbers. Today, randomness is fundamental to security and cryptographic systems, as well as safeguarding privacy. A…
We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations…
In previous works, hexagonal cellular automata (CA) have been studied as a variation of the famous Game of Life CA, mainly for spiral phenomena simulations; where the most interesting constructions are related to the Belousov-Zhabotinsky…
Many hard combinatorial problems can be mapped onto Ising models, which replicate the behavior of classical spins. Recent advances in probabilistic computers are characterized by parallelization and the introduction of novel hardware…
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are…
Lightweight cryptography was primarily inspired by the design criteria of symmetric cryptography. It plays a vital role in ensuring the security, privacy, and reliability of microelectronic devices without compromising the overall…
Quantum cellular automata (QCA) evolve qubits in a quantum circuit depending only on the states of their neighborhoods and model how rich physical complexity can emerge from a simple set of underlying dynamical rules. For instance,…
We study a Life-like cellular automaton rule $B2/S2345$ where a cell in state `0' takes state `1' if it has exactly two neighbors in state `1' and the cell remains in the state `1' if it has between two and five neighbors in state `1.' This…
Segmentation is a fundamental process in microscopic cell image analysis. With the advent of recent advances in deep learning, more accurate and high-throughput cell segmentation has become feasible. However, most existing deep…
Periodic lattices have been widely explored for decades, owing to their peculiar vibrational behavior. On the other hand, certain types of aperiodic lattices have enabled new phenomena that may not be otherwise attainable in periodic ones.…
A comparative algebraic framework for elementary cellular automata is developed, centered on the role of spatial symmetry. The primary object of study is Rule~22, the elementary cellular automaton with algebraic normal form…
Artificial neurons built on synthetic gene networks have potential applications ranging from complex cellular decision-making to bioreactor regulation. Furthermore, due to the high information throughput of natural systems, it provides an…
Supersaturated design (SSD) has received much recent interest because of its potential in factor screening experiments. In this paper, we provide equivalent conditions for two columns to be fully aliased and consequently propose methods for…
We show that a cellular automaton on a one-dimensional two-sided mixing subshift of finite type is a von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic…