Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning

DOI10.1007/978-3-031-14926-9_2MaRDI QIDQ6488205zbMATH OpenFDO

Authors Jimmy Jose

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-031-14926-9_2

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Recommendations

• Designing cryptographically strong \(S\)-boxes with the use of cellular automata
• Cryptographically Strong S-Boxes Based on Cellular Automata
• Cellular automata based S-boxes
• Designing cryptographically strong S-boxes with use of 1D cellular automata
• Cryptographically strong S-boxes generated by modified immune algorithm

Cites work

• Boolean functions for cryptography and coding theory
• Cellular automata based S-boxes
• Exploring semi-bent Boolean functions arising from cellular automata
• Reinforcement learning. An introduction
• Statistical mechanics of cellular automata

Cited in

(3)

• Cellular automata based S-boxes
• Cryptographically Strong S-Boxes Based on Cellular Automata
• Pushing the limits: searching for implementations with the smallest area for lightweight S-boxes

This page was built for publication: Exploring Lightweight S-boxes Using Cellular Automata and Reinforcement Learning

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