Testing a cellular automata construction method to obtain 9-variable cryptographic Boolean functions
Cryptography and Security
2025-01-17 v1
Abstract
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.
Cite
@article{arxiv.2501.09380,
title = {Testing a cellular automata construction method to obtain 9-variable cryptographic Boolean functions},
author = {Thomas Prévost and Bruno Martin},
journal= {arXiv preprint arXiv:2501.09380},
year = {2025}
}