Advances on random sequence generation by uniform cellular automata

DOI10.1007/978-3-319-13350-8_5zbMATH Open1323.68392OpenAlexW184356974MaRDI QIDQ2944879FDOQ2944879

Authors: Katsunobu Imai, Jean-Baptiste Yunès, Enrico Formenti, Bruno Martin 

Publication date: 8 September 2015

Published in: Computing with New Resources (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_5

Recommendations

• scientific article; zbMATH DE number 7385042
• Parallel Processing and Applied Mathematics
• On the use of cellular automata in symmetric cryptography
• scientific article; zbMATH DE number 1931455
• scientific article; zbMATH DE number 2184880

zbMATH Keywords

random number generationcellular automataBoolean functions

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80) Automata sequences (11B85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A spectral characterization of correlation-immune combining functions
• Title not available (Why is that?)
• Weight distributions of the cosets of the (32,6) Reed-Muller code
• Automata, Languages and Programming
• THE FIRING SQUAD SYNCHRONIZATION PROBLEM ON SQUARES, TORUSES AND RINGS
• A Walsh exploration of elementary CA rules
• Pseudorandomness

Cited In (28)

• Cryptographic properties of Boolean functions defining elementary cellular automata
• Heuristic search of (semi-)bent functions based on cellular automata
• Exploring semi-bent Boolean functions arising from cellular automata
• Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
• Cryptographically suitable maximum length cellular automata
• Search space reduction of asynchrony immune cellular automata
• Synthesis of maximum length cellular automata with nonlinearity injections
• \(d\)-monomial tests of nonlinear cellular automata for cryptographic design
• Resilient vectorial functions and cyclic codes arising from cellular automata
• Asynchrony immune cellular automata
• Pseudo-random sequences, Boolean functions and cellular automata
• A cryptographic and coding-theoretic perspective on the global rules of cellular automata
• Randomness quality and trade-offs for CA random string generators
• Cryptographic properties of bipermutive cellular automata rules
• 1-resiliency of bipermutive cellular automata rules
• An Efficient n ×n Boolean Mapping Using Additive Cellular Automata
• A Walsh exploration of elementary CA rules
• 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
• Binomial representation of cryptographic binary sequences and its relation to cellular automata
• Propagation characteristics of the divergence of elementary cellular automata
• Parallel Processing and Applied Mathematics
• Symmetric random function generator (SRFG): a novel cryptographic primitive for designing fast and robust algorithms
• A survey of cellular automata: types, dynamics, non-uniformity and applications
• Enumeration of maximal cycles generated by orthogonal 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: 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)