Analysis of Pseudo Random Sequences Generated by Cellular Automata

From MaRDI portal
Publication:4037465

DOI10.1007/3-540-46416-6_17zbMath0791.68121OpenAlexW2144769627MaRDI QIDQ4037465

Othmar Staffelbach, Willi Meier

Publication date: 18 May 1993

Published in: Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-46416-6_17




Related Items (21)

Investigating four neighbourhood cellular automata as better cryptographic primitivesModelling the shrinking generator in terms of linear CACAR30: a new scalable stream cipher with rule 30Resilient Vectorial Functions and Cyclic Codes Arising from Cellular AutomataA cryptographic and coding-theoretic perspective on the global rules of cellular automataCARPenter: A Cellular Automata Based Resilient Pentavalent Stream CipherHeuristic search of (semi-)bent functions based on cellular automataCellular Automata Pseudo-Random Number Generators and Their Resistance to AsynchronyAchieving Better Security Using Nonlinear Cellular Automata as a Cryptographic PrimitiveA Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel AttacksDistributed Multi-authority Attribute-Based Encryption Using Cellular AutomataA multisecret sharing scheme for color images based on cellular automataGenerating Cryptographically Suitable Non-linear Maximum Length Cellular AutomataChaotic Cellular Automata with Cryptographic Applicationd-Monomial Tests of Nonlinear Cellular Automata for Cryptographic DesignParallel random number generator for inexpensive configurable hardware cellsThe topological skeleton of cellular automaton dynamicsReduced Complexity Attacks on the Alternating Step GeneratorUnnamed ItemFast and Memory-Efficient Key Recovery in Side-Channel AttacksA secret sharing scheme based on cellular automata







This page was built for publication: Analysis of Pseudo Random Sequences Generated by Cellular Automata