Exploring Semi-bent Boolean Functions Arising from Cellular Automata

@inproceedings{Mariot2020ExploringSB,
  title={Exploring Semi-bent Boolean Functions Arising from Cellular Automata},
  author={L. Mariot and Martina Saletta and A. Leporati and L. Manzoni},
  booktitle={ACRI},
  year={2020}
}
Semi-bent Boolean functions are interesting from a cryptographic standpoint, since they possess several desirable properties such as having a low and flat Walsh spectrum, which is useful to resist linear cryptanalysis. In this paper, we consider the search of semi-bent functions through a construction based on cellular automata (CA). In particular, the construction defines a Boolean function by computing the XOR of all output cells in the CA. Since the resulting Boolean functions have the same… Expand

References

SHOWING 1-10 OF 16 REFERENCES
Cryptographic Properties of Bipermutive Cellular Automata Rules
Cellular automata based S-boxes
Inversion of Mutually Orthogonal Cellular Automata
Advances on Random Sequence Generation by Uniform Cellular Automata
Mutually orthogonal latin squares based on cellular automata
Cellular Automata Pseudo-Random Number Generators and Their Resistance to Asynchrony
BENT FUNCTIONS
Computing the periods of preimages in surjective cellular automata
Cellular automata computations and secret key cryptography
Cryptographically Strong S-Boxes Based on Cellular Automata
...
1
2
...