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

DOI10.1007/978-3-031-14926-9_5MaRDI QIDQ6394816zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: We investigate S-boxes defined by pairs of Orthogonal Cellular Automata (OCA), motivated by the fact that such CA always define bijective vectorial Boolean functions, and could thus be interesting for the design of block ciphers. In particular, we perform an exhaustive search of all nonlinear OCA pairs of diameter $d=4$ and $d=5$, which generate S-boxes of size $6imes6$ and $8imes8$, respectively. Surprisingly, all these S-boxes turn out to be linear, and thus they are not useful for the design of confusion layers in block ciphers. However, a closer inspection of these S-boxes reveals a very interesting structure. Indeed, we remark that the linear components space of the OCA-based S-boxes found by our exhaustive search are themselves the kernels of linear CA, or, equivalently, emph{polynomial codes}. We finally classify the polynomial codes of the S-boxes obtained in our exhaustive search and observe that, in most cases, they actually correspond to the cyclic code with generator polynomial $X^b+1$, where $b=d-1$. Although these findings rule out the possibility of using OCA to design good S-boxes in block ciphers, they give nonetheless some interesting insights for a theoretical characterization of nonlinear OCA pairs, which is still an open question in general.

Recommendations

• Cellular automata based S-boxes
• Designing cryptographically strong S-boxes with use of 1D cellular automata
• Cryptographically Strong S-Boxes Based on Cellular Automata
• Designing cryptographically strong \(S\)-boxes with the use of cellular automata
• On the Classification of 4 Bit S-Boxes

Cites work

• A cryptographic and coding-theoretic perspective on the global rules of cellular automata
• Block Encryption Using Reversible Cellular Automata
• Boolean functions for cryptography and coding theory
• Cellular automata based S-boxes
• Combinatorial Designs
• Cryptographic properties of bipermutive cellular automata rules
• Cryptographically Strong S-Boxes Based on Cellular Automata
• Cryptography. Theory and practice
• Discrete Physics, Cellular Automata and Cryptography
• Enumerating orthogonal Latin squares generated by bipermutive cellular automata
• Exhaustive evaluation of radius 2 toggle rules for a variable-length cryptographic cellular automata-based model
• scientific article; zbMATH DE number 2025824 (Why is no real title available?)
• Keccak
• Latin hypercubes and cellular automata
• Mutually orthogonal Latin squares based on cellular automata
• On the need for multipermutations: Cryptanalysis of MD4 and SAFER
• Partially permutive cellular automata
• Polynomial codes
• PRESENT: An Ultra-Lightweight Block Cipher
• The design of Rijndael. The Advanced Encryption Standard (AES)

Cited in

(1)

• Cellular automata based S-boxes

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

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