Cryptographically Strong S-Boxes Based on Cellular Automata
From MaRDI portal
Recommendations
- Designing cryptographically strong \(S\)-boxes with the use of cellular automata
- Designing cryptographically strong S-boxes with use of 1D cellular automata
- Cellular automata based S-boxes
- Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning
- A novel method for designing S-boxes based on chaotic maps
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 1189380 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- scientific article; zbMATH DE number 1424195 (Why is no real title available?)
- Information Security and Privacy
- Multi-objective optimisation of bijective S-boxes
- The designs of S-boxes by simulated annealing
Cited in
(10)- Cellular automata based S-boxes
- Literature survey on nonlinear components and chaotic nonlinear components of block ciphers
- Designing cryptographically strong \(S\)-boxes with the use of cellular automata
- Designing cryptographically strong S-boxes with use of 1D cellular automata
- SPF-CA: a new cellular automata based block cipher using key-dependent S-boxes
- On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata
- Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning
- Insights gained after a decade of cellular automata-based cryptography
- Combinatorial designs and cellular automata: a survey
- Exploring semi-bent Boolean functions arising from cellular automata
This page was built for publication: Cryptographically Strong S-Boxes Based on Cellular Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541781)