Testing a Cellular Automata Construction Method to Obtain 9-variable Cryptographic Boolean Functions
Thomas Prévost and Bruno Martin
We propose a method for constructing 9-variable cryptographic Boolean functions from the iterates of 5-variable cellular automata rules. We then analyze, for important cryptographic properties of 5-variable cellular automata rules, how they are preserved after extension to 9-variable Boolean functions. For each cryptographic property, we analyze the proportion of 5-variable cellular automata rules that preserve it for each of the 48 affine equivalence classes.
Keywords: Boolean functions, cellular automata, cryptography, affine equivalence classes
DOI: 10.32908/jca.v18.100924