Related papers: A 10-bit S-box generated by Feistel construction f…

Motivated by the need to hide the complexity of the physical layer from performance analysis in a layer 2 protocol, a class of abstract receivers, called Poisson receivers, was recently proposed in [1] as a probabilistic framework for…

An exact characterization of the different dynamical behavior that exhibit the space phase of a reversible and conservative cellular automaton, the so called Q2R model, is shown in this paper. Q2R is a cellular automaton which is a…

Internet of Things is an ecosystem of interconnected devices that are accessible through the internet. The recent research focuses on adding more smartness and intelligence to these edge devices. This makes them susceptible to various kinds…

In this article, we present a real-time three dimensional (3D) hybrid beamforming for fifth generation (5G) wireless networks. One of the key concepts in 5G cellular systems is the small cell network, which settles the high mobile traffic…

Spins based in silicon provide one of the most promising architectures for quantum computing. Quantum dots are an inherently scalable technology. Here, we combine these two concepts into a workable design for a silicon-germanium quantum…

This paper introduces a novel and fully unsupervised framework for conditional GAN training in which labels are automatically obtained from data. We incorporate a clustering network into the standard conditional GAN framework that plays…

The Besicovitch pseudo-metric is a shift-invariant pseudo-metric on the set of infinite sequences, that enjoys interesting properties and is suitable for studying the dynamics of cellular automata. They correspond to the asymptotic behavior…

Despite being trained on balanced datasets, existing AI-generated image detectors often exhibit systematic bias at test time, frequently misclassifying fake images as real. We hypothesize that this behavior stems from distributional shift…

We present a new approach to constructing of pseudo-random binary sequences (PRS) generators for the purpose of cryptographic data protection, secured from the perpetrator's attacks, caused by generation of masses of hardware errors and…

Various non-classical approaches of distributed information processing, such as neural networks, computation with Ising models, reservoir computing, vector symbolic architectures, and others, employ the principle of collective-state…

Data Encryption Standard (DES) is based on the Feistel block cipher, developed in 1971 by IBM cryptography researcher Horst Feistel. DES uses 16 rounds of the Feistel structure. But with the changes in recent years, the internet is starting…

The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between…

We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…

We demonstrate extraction of randomness from spontaneous-emission events less than 36 ns in the past, giving output bits with excess predictability below $10^{-5}$ and strong metrological randomness assurances. This randomness generation…

Directed acyclic graphs or Bayesian networks that are popular in many AI related sectors for probabilistic inference and causal reasoning can be mapped to probabilistic circuits built out of probabilistic bits (p-bits), analogous to binary…

This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation behave in two opposite ways with respect to the complexity…

We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative…

It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. Explaining the fractal structure of the spacetime diagrams of cellular…

The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram, ie the infinite sequence of states of a particular cell of a configuration; in the language of symbolic dynamics one…

Let L:=Z^D be a D-dimensional lattice. Let A^L be the Cantor space of L-indexed configurations in a finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F:A^L-->A^L. An…