Random sequence generation by cellular automata
From MaRDI portal
Publication:1082817
DOI10.1016/0196-8858(86)90028-XzbMath0603.68053MaRDI QIDQ1082817
Publication date: 1986
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Cellular automata (computational aspects) (68Q80) Random number generation in numerical analysis (65C10)
Related Items
One-dimensional cellular automata with random rules: longest temporal period of a periodic solution, Periodic solutions of one-dimensional cellular automata with uniformly chosen random rules, SPF-CA: A new cellular automata based block cipher using key-dependent S-boxes, Entropy estimation of symbol sequences, One-dimensional pattern generation by cellular automata, A new symmetrical cryptosystem based cellular automata and chaotic map function, Cellular automaton fluids. I: Basic theory, NONINVERTIBLE TRANSFORMATIONS AND SPATIOTEMPORAL RANDOMNESS, Local structure theory for cellular automata, On the use of cellular automata in symmetric cryptography, Intriguing properties of global structure in some classes of finite cellular automata, Digital mechanics. An information process based on reversible universal cellular automata, Investigating four neighbourhood cellular automata as better cryptographic primitives, Statistical Equilibrium in Deterministic Cellular Automata, Cylindrical cellular automata, CAR30: a new scalable stream cipher with rule 30, A search for good pseudo-random number generators: survey and empirical studies, Computational processes, observers and Turing incompleteness, The geometrically nonlinear Cosserat micropolar shear–stretch energy. Part II: Non‐classical energy‐minimizing microrotations in 3D and their computational validation***, Robust periodic solutions and evolution from seeds in one-dimensional edge cellular automata, Disentangling complexity from randomness and chaos, von Neumann standard quantum mechanics is logically inconsistent, A survey of cellular automata: types, dynamics, non-uniformity and applications, Simple chain automaton random number generator for IoT devices, Achieving Better Security Using Nonlinear Cellular Automata as a Cryptographic Primitive, Behavior of complemented CA whose complement vector is acyclic in a linear TPMACA., Random number generation using decimal cellular automata, Chaos in a ring circuit, Unnamed Item, Modelling nonlinear sequence generators in terms of linear cellular automata, Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations, Distributed Multi-authority Attribute-Based Encryption Using Cellular Automata, One-dimensional pattern generation by cellular automata, A multisecret sharing scheme for color images based on cellular automata, Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata, d-Monomial Tests of Nonlinear Cellular Automata for Cryptographic Design, Exhaustive Evaluation of Radius 2 Toggle Rules for a Variable-Length Cryptographic Cellular Automata-Based Model, Characterization of CA Rules for SACA Targeting Detection of Faulty Nodes in WSN, RANDOM NUMBER GENERATION BY CELLULAR AUTOMATA WITH MEMORY, Parallel random number generator for inexpensive configurable hardware cells, A simple linearization of the self-shrinking generator by means of cellular automata, The topological skeleton of cellular automaton dynamics, Design of fault-resilient S-boxes for AES-like block ciphers, A Cryptosystem Based on the Composition of Reversible Cellular Automata, Unnamed Item, Characterization of Single Cycle CA and its Application in Pattern Classification, Design of fast one-pass authenticated and randomized encryption schema using reversible cellular automata, Boolean derivatives on cellular automata, Cellular Automata with Random Memory and Its Implementations, An explicit similarity transform between cellular automata and LFSR matrices, A numerical study of one-dimensional cellular automata, ONE-DIMENSIONAL CELLULAR AUTOMATA WITH MEMORY: PATTERNS FROM A SINGLE SITE SEED, The parts and the whole: inquiring how the interaction of simple subsystems generates complexity, Hidden potentialities, A secret sharing scheme based on cellular automata, Complexity analysis of time series generated by elementary cellular automata, Aperiodicity in one-dimensional cellular automata, Nearest neighbor cellular automata over \(Z_ 2\) with periodic boundary conditions, Modeling Cache Memory Utilization on Multicore Using Common Pool Resource Game on Cellular Automata, Percolation and disorder-resistance in cellular automata, Generating nonlinear codes for multi-bit symbol error correction using cellular automata
Cites Work
- Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
- Algebraic properties of cellular automata
- Is \(\pi\) normal ?
- Computation theory of cellular automata
- An answer to a question by J. Milnor
- Toward a quantitative theory of self-generated complexity
- Regularities in congruential random number generators
- Parity, circuits, and the polynomial-time hierarchy
- Geometry of Binomial Coefficients
- Statistical mechanics of cellular automata
- The 3x + 1 Problem and Its Generalizations
- A Simple Unpredictable Pseudo-Random Number Generator
- Probability Distributions Related to Random Mappings
- Endomorphisms and automorphisms of the shift dynamical system
- Statistical Study of Digits of Some Square Roots of Integers in Various Bases
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
