Cryptographically Strong S-Boxes Based on Cellular Automata

DOI10.1007/978-3-540-79992-4_62zbMath1159.94372OpenAlexW1873422120MaRDI QIDQ3541781

Franciszek Seredyński, Mirosław Szaban

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79992-4_62

zbMATH Keywords

cellular automatacryptographyBoolean functionsblock cipherS-boxes

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80)

Related Items (3)

Exploring semi-bent Boolean functions arising from cellular automata ⋮ Literature survey on nonlinear components and chaotic nonlinear components of block ciphers ⋮ On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata

Cites Work

• Multi-objective optimisation of bijective S-boxes
• The designs of S-boxes by simulated annealing
• Information Security and Privacy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cryptographically Strong S-Boxes Based on Cellular Automata