Nonuniform cellular automata for cryptography
From MaRDI portal
Recommendations
Cited in
(17)- A cryptosystem based on cellular automata
- A method of secure digital communication based on a cellular automaton with rapid dispersion of errors
- Cryptography with asynchronous logic automata
- Distributed multi-authority attribute-based encryption using cellular automata
- Analysis of Pseudo Random Sequences Generated by Cellular Automata
- scientific article; zbMATH DE number 2016512 (Why is no real title available?)
- scientific article; zbMATH DE number 2040658 (Why is no real title available?)
- scientific article; zbMATH DE number 2043386 (Why is no real title available?)
- scientific article; zbMATH DE number 1461547 (Why is no real title available?)
- scientific article; zbMATH DE number 7385042 (Why is no real title available?)
- Achieving better security using nonlinear cellular automata as a cryptographic primitive
- Secure and computationally efficient cryptographic primitive based on cellular automaton
- A one-key cryptosystem based on a finite nonlinear automaton
- Parallel Processing and Applied Mathematics
- The cryptographic properties of von Neumann cellular automata
- Simple chain automaton random number generator for IoT devices
- Non-linear and non-group cellular automata chaining technique for cryptographic applications
This page was built for publication: Nonuniform cellular automata for cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321450)
