Analysis of Pseudo Random Sequences Generated by Cellular Automata

DOI10.1007/3-540-46416-6_17MaRDI QIDQ4037465zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(32)

• Reduced Complexity Attacks on the Alternating Step Generator
• Heuristic search of (semi-)bent functions based on cellular automata
• scientific article; zbMATH DE number 2043340 (Why is no real title available?)
• CAR30: a new scalable stream cipher with rule 30
• Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
• Pseudorandom bit generators from enhanced cellular automata
• Parallel random number generator for inexpensive configurable hardware cells
• The topological skeleton of cellular automaton dynamics
• Fast and memory-efficient key recovery in side-channel attacks
• scientific article; zbMATH DE number 2077097 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 2114007 (Why is no real title available?)
• A secret sharing scheme based on cellular automata
• A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks
• A cryptographic and coding-theoretic perspective on the global rules of cellular automata
• Modelling the shrinking generator in terms of linear CA
• A method of secure digital communication based on a cellular automaton with rapid dispersion of errors
• Insights gained after a decade of cellular automata-based cryptography
• Generating cryptographically suitable non-linear maximum length cellular automata
• Investigating four neighbourhood cellular automata as better cryptographic primitives
• A multisecret sharing scheme for color images based on cellular automata
• scientific article; zbMATH DE number 7199588 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 7301769 (Why is no real title available?)

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)