Advances on random sequence generation by uniform cellular automata
From MaRDI portal
Recommendations
Cites work
- A spectral characterization of correlation-immune combining functions
- A Walsh exploration of elementary CA rules
- Automata, Languages and Programming
- scientific article; zbMATH DE number 5862915 (Why is no real title available?)
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 3896264 (Why is no real title available?)
- scientific article; zbMATH DE number 3986649 (Why is no real title available?)
- Pseudorandomness
- THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
- Weight distributions of the cosets of the (32,6) Reed-Muller code
Cited in
(32)- Symmetric random function generator (SRFG): a novel cryptographic primitive for designing fast and robust algorithms
- Binomial representation of cryptographic binary sequences and its relation to cellular automata
- Cryptographic properties of bipermutive cellular automata rules
- 1-resiliency of bipermutive cellular automata rules
- Propagation characteristics of the divergence of elementary cellular automata
- A Walsh exploration of elementary CA rules
- An Efficient n ×n Boolean Mapping Using Additive Cellular Automata
- Resilient vectorial functions and cyclic codes arising from cellular automata
- Asynchrony immune cellular automata
- Generating cryptographically suitable non-linear maximum length cellular automata
- \(d\)-monomial tests of nonlinear cellular automata for cryptographic design
- Investigating four neighbourhood cellular automata as better cryptographic primitives
- Achieving better security using nonlinear cellular automata as a cryptographic primitive
- scientific article; zbMATH DE number 7301769 (Why is no real title available?)
- Parallel Processing and Applied Mathematics
- Cryptographically suitable maximum length cellular automata
- Cryptographic properties of Boolean functions defining elementary cellular automata
- A cryptographic and coding-theoretic perspective on the global rules of cellular automata
- Heuristic search of (semi-)bent functions based on cellular automata
- Synthesis of maximum length cellular automata with nonlinearity injections
- Search space reduction of asynchrony immune cellular automata
- A survey of cellular automata: types, dynamics, non-uniformity and applications
- Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
- Enumeration of maximal cycles generated by orthogonal cellular automata
- Pseudo-random sequences, Boolean functions and cellular automata
- Randomness quality and trade-offs for CA random string generators
- Insights gained after a decade of cellular automata-based cryptography
- Self-orthogonal cellular automata
- Combinatorial designs and cellular automata: a survey
- Identification of cellular automata on spaces of Bernoulli probability measures
- Cellular automata on spaces of probability measures
- Exploring semi-bent Boolean functions arising from cellular automata
This page was built for publication: Advances on random sequence generation by uniform cellular automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944879)
