Related papers: Lattice Gas Symmetric Cryptography
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
Lattice-based Cryptography is considered to have the characteristics of classical computers and quantum attack resistance. We will design various graphic lattices and matrix lattices based on knowledge of graph theory and topological…
We review the class of cellular automata known as lattice gases, and their applications to problems in physics and materials science. The presentation is self-contained, and assumes very little prior knowledge of the subject. Hydrodynamic…
Lattice geometry profoundly shapes physical phenomena such as subsystem symmetry and directed percolation (DP). Among various lattice geometries, hyperbolic lattices are characterized by constant negative curvature and non-Abelian…
Cellular Automata (CA) are an interesting computational model for designing Pseudorandom Number Generators (PRNG), due to the complex dynamical behavior they can exhibit depending on the underlying local rule. Most of the CA-based PRNGs…
A cellular automaton model of pulsar glitches is described, based on the superfluid vortex unpinning paradigm. Recent analyses of pulsar glitch data suggest that glitches result from scale-invariant avalanches \citep{Melatos07a}, which are…
A lattice-gas cellular automaton (LGCA) model is used to simulate rippling and aggregation in myxobacteria. An efficient way of representing cells of different cell size, shape and orientation is presented that may be easily extended to…
Orthogonal Cellular Automata (OCA) have been recently investigated in the literature as a new approach to construct orthogonal Latin squares for cryptographic applications such as secret sharing schemes. In this paper, we consider OCA for a…
A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
A new nonlinear Rao-Nam like symmetric key encryption scheme is presented in this paper. QC-LDPC lattices that are practically implementable in high dimensions due to their low complexity encoding and decoding algorithms, are used in our…
Building upon the Integer Lattice Gas Automata framework of Blommel \textit{et al.} \cite{PhysRevE.97.023310}, we introduce a simplified, fluctuation-free variant. This approach relies on floating-point numbers and closely mirrors the…
Key Encapsulation Mechanisms (KEMs) are a set of cryptographic techniques that are designed to provide symmetric encryption key using asymmetric mechanism (public key). In the current study, we concentrate on design and analysis of key…
Lattice-based cryptography relies on generating random bases which are difficult to fully reduce. Given a lattice basis (such as the private basis for a cryptosystem), all other bases are related by multiplication by matrices in…
A condensed history and theoretical development of lattice-gas automata in the Boltzmann limit is presented. This is provided as background to set up the context for understanding the implementation of the lattice-gas method on two parallel…
Quantum cellular automata (QCA) are models of quantum computation of particular interest from the point of view of quantum simulation. Quantum lattice gas automata (QLGA - equivalently partitioned quantum cellular automata) represent an…
Conserved lattice gas (CLG) models in one dimension exhibit absorbing state phase transition (APT) with simple integer exponents $\beta=1=\nu=\eta$ whereas the same on a ladder belong to directed percolation (DP)universality. We conjecture…
This paper studies a $K$-user lattice-code based multiple-access (LCMA) scheme. Each user equipment (UE) encode its message with a practical lattice code, where we suggest a $2^m$-ary \emph{ring code} with symbol-wise bijective mapping to…
Several cellular automata (CA) models have been developed to simulate self-organization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction…
Low density lattice codes (LDLC) are a family of lattice codes that can be decoded efficiently using a message-passing algorithm. In the original LDLC decoder, the message exchanged between variable nodes and check nodes are continuous…