Analysis of Pseudo Random Sequences Generated by Cellular Automata

DOI10.1007/3-540-46416-6_17zbMATH Open0791.68121OpenAlexW2144769627MaRDI QIDQ4037465FDOQ4037465

Authors: Willi Meier, Othmar Staffelbach 

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

Recommendations

• scientific article; zbMATH DE number 2077097
• On the use of cellular automata in symmetric cryptography
• Cellular automata in stream ciphers
• Nonuniform cellular automata for cryptography
• Parallel Processing and Applied Mathematics

zbMATH Keywords

cellular automatasecuritycryptanalysisstream cipherspseudorandom sequence generation

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Cryptography (94A60) Cellular automata (computational aspects) (68Q80)

Cited In (32)

• Heuristic search of (semi-)bent functions based on cellular automata
• Reduced Complexity Attacks on the Alternating Step Generator
• Title not available (Why is that?)
• Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
• CAR30: a new scalable stream cipher with rule 30
• Pseudorandom bit generators from enhanced cellular automata
• Parallel random number generator for inexpensive configurable hardware cells
• Title not available (Why is that?)
• The topological skeleton of cellular automaton dynamics
• Fast and memory-efficient key recovery in side-channel attacks
• Chaotic cellular automata with cryptographic application
• \(d\)-monomial tests of nonlinear cellular automata for cryptographic design
• Resilient vectorial functions and cyclic codes arising from cellular automata
• Title not available (Why is that?)
• A secret sharing scheme based on cellular automata
• A cryptographic and coding-theoretic perspective on the global rules of cellular automata
• A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
• Insights gained after a decade of cellular automata-based cryptography
• Modelling the shrinking generator in terms of linear CA
• Generating cryptographically suitable non-linear maximum length cellular automata
• A method of secure digital communication based on a cellular automaton with rapid dispersion of errors
• Investigating four neighbourhood cellular automata as better cryptographic primitives
• A multisecret sharing scheme for color images based on cellular automata
• Title not available (Why is that?)
• Parallel Processing and Applied Mathematics
• CARPenter: A Cellular Automata Based Resilient Pentavalent Stream Cipher
• Enumeration of maximal cycles generated by orthogonal cellular automata
• Triple-coupling cellular automata and their application to image encryption
• Nonuniform cellular automata for cryptography
• Distributed multi-authority attribute-based encryption using cellular automata
• Achieving better security using nonlinear cellular automata as a cryptographic primitive
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037465)