On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata

DOI10.1007/978-3-031-14926-9_5zbMath1521.94056arXiv2203.14365OpenAlexW4291136770MaRDI QIDQ6394816

Luca Mariot, Luca Manzoni

Publication date: 27 March 2022

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

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80) Cyclic codes (94B15) Boolean functions (94D10)

Cites Work

• Unnamed Item
• Unnamed Item
• The design of Rijndael. The Advanced Encryption Standard (AES)
• Enumerating orthogonal Latin squares generated by bipermutive cellular automata
• Cellular automata based S-boxes
• Latin hypercubes and cellular automata
• Mutually orthogonal Latin squares based on cellular automata
• PRESENT: An Ultra-Lightweight Block Cipher
• Discrete Physics, Cellular Automata and Cryptography
• Cryptographically Strong S-Boxes Based on Cellular Automata
• Partially permutive cellular automata
• Combinatorial Designs
• On the need for multipermutations: Cryptanalysis of MD4 and SAFER
• Keccak
• Exhaustive Evaluation of Radius 2 Toggle Rules for a Variable-Length Cryptographic Cellular Automata-Based Model
• Boolean Functions for Cryptography and Coding Theory
• Block Encryption Using Reversible Cellular Automata
• Polynomial codes
• Cryptography
• A cryptographic and coding-theoretic perspective on the global rules of cellular automata

This page was built for publication: On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata