Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations
From MaRDI portal
Recommendations
- A cellular automata based method for predicting binary sequences
- Modelling of Complex Cryptographic Systems in Terms of Simple Cellular Automata
- On the use of cellular automata in symmetric cryptography
- Synthesis of cryptographic interleaved sequences by means of linear cellular automata
- Chaotic cellular automata with cryptographic application
Cites work
- 2-by-n hybrid cellular automata with regular configuration: theory and application
- An analysis of the structure and complexity of nonlinear binary sequence generators
- Concatenated Automata in Cryptanalysis of Stream Ciphers
- scientific article; zbMATH DE number 3865150 (Why is no real title available?)
- scientific article; zbMATH DE number 3978977 (Why is no real title available?)
- scientific article; zbMATH DE number 4023423 (Why is no real title available?)
- scientific article; zbMATH DE number 1024042 (Why is no real title available?)
- Random sequence generation by cellular automata
- Theory and applications of q-ary interleaved sequences
- Theory of cellular automata: a survey
Cited in
(3)
This page was built for publication: Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541740)