The following pages link to Cellular automata based S-boxes (Q1755184):
Displaying 12 items.
- Exploring semi-bent Boolean functions arising from cellular automata (Q831678) (← links)
- Design of fault-resilient S-boxes for AES-like block ciphers (Q2040333) (← links)
- Mutually orthogonal Latin squares based on cellular automata (Q2291667) (← links)
- Designing cryptographically strong \(S\)-boxes with the use of cellular automata (Q2442968) (← links)
- The designs of S-boxes by simulated annealing (Q2493292) (← links)
- Heuristic search of (semi-)bent functions based on cellular automata (Q6137187) (← links)
- Search space reduction of asynchrony immune cellular automata (Q6151171) (← links)
- Inversion of Mutually Orthogonal Cellular Automata (Q6163604) (← links)
- On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata (Q6394816) (← links)
- Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning (Q6488205) (← links)
- Enumeration of maximal cycles generated by orthogonal cellular automata (Q6535752) (← links)
- Insights gained after a decade of cellular automata-based cryptography (Q6637836) (← links)