Paper 2020/1272
Bent Functions from Cellular Automata
Maximilien Gadouleau, Luca Mariot, and Stjepan Picek
Abstract
In this work, we present a primary construction of bent functions based on cellular automata (CA). We consider the well-known characterization of bent functions in terms of Hadamard matrices and employ some recent results about mutually orthogonal Latin squares (MOLS) based on linear bipermutive CA (LBCA) to design families of Hadamard matrices of the form required for bent functions. In particular, the main question to address in this construction can be reduced to finding a large enough set of coprime polynomials over
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- bent functionscellular automataHadamard matricesLatin squaresorthogonal arrayspolynomialspartial spreads
- Contact author(s)
- l mariot @ tudelft nl
- History
- 2020-10-14: received
- Short URL
- https://ia.cr/2020/1272
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1272, author = {Maximilien Gadouleau and Luca Mariot and Stjepan Picek}, title = {Bent Functions from Cellular Automata}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/1272}, year = {2020}, url = {https://eprint.iacr.org/2020/1272} }