Insights gained after a decade of cellular automata-based cryptography

DOI10.1007/978-3-031-65887-7_3MaRDI QIDQ6637836

Luca Mariot

Publication date: 13 November 2024

zbMATH Keywords

cellular automatacryptographystream ciphersBoolean functionsblock cipherspseudorandom number generators

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Results on rotation-symmetric S-boxes
• The design of Rijndael. The Advanced Encryption Standard (AES)
• New stream cipher designs. The eSTREAM finalists
• Rotation symmetry in algebraically generated cryptographic substitution tables
• Quasilinear cellular automata
• Invertible shift-invariant transformations on binary arrays
• Investigating topological chaos by elementary cellular automata dynamics
• Cellular automata based S-boxes
• Mutually orthogonal Latin squares based on cellular automata
• A secret sharing scheme based on cellular automata
• Bent functions in the partial spread class generated by linear recurring sequences
• Cryptographic properties of bipermutive cellular automata rules
• 1-Resiliency of Bipermutive Cellular Automata Rules
• Advances on Random Sequence Generation by Uniform Cellular Automata
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• On the Diffusion Property of Iterated Functions
• Discrete Physics, Cellular Automata and Cryptography
• Cryptographically Strong S-Boxes Based on Cellular Automata
• A New Attack on the Filter Generator
• A Cryptosystem Based on the Composition of Reversible Cellular Automata
• Communication Theory of Secrecy Systems*
• Statistical mechanics of cellular automata
• Analysis of Pseudo Random Sequences Generated by Cellular Automata
• Foundations of Cryptography
• Fast Hashing and Stream Encryption with Panama
• Introduction to Modern Cryptography
• Boolean Functions for Cryptography and Coding Theory
• Shift-register synthesis and BCH decoding
• Endomorphisms and automorphisms of the shift dynamical system
• Automata, Languages and Programming
• A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
• Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
• Invertible quadratic non-linear functions over \(\mathbb{F}_p^n\) via multiple local maps
• Computing the periods of preimages in surjective cellular automata
• Propagation properties of a non-linear mapping based on squaring in odd characteristic

This page was built for publication: Insights gained after a decade of cellular automata-based cryptography

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