Heuristic search of (semi-)bent functions based on cellular automata
Heuristic search of (semi-)bent functions based on cellular automata
Abstract An interesting thread in the research of Boolean functions for cryptography and coding theory is the study of secondary constructions : given a known function with a good cryptographic profile, the aim is to extend it to a (usually larger) function possessing analogous properties. In this work, we continue …