Construction of Ternary Bent Functions by FFT-like Permutation Algorithms

Binary bent functions have a strictly specified number of non-zero values. In the same way, ternary bent functions satisfy certain requirements on the elements of their value vectors. These requirements can be used to specify six classes of ternary bent functions. Classes are mutually related by encoding of function values. Given a basic ternary bent function, other functions in the same class can be constructed by permutation matrices having a block structure similar to that of the factor matrices appearing in the Good-Thomas decomposition of Cooley-Tukey Fast Fourier transform and related algorithms.

[1]  H. Nussbaumer.  Fast Fourier transform and convolution algorithms , 1981 .

[2]  Sihem Mesnager,et al.  Four decades of research on bent functions , 2016, Des. Codes Cryptogr..

[3]  Natalia N. Tokareva,et al.  Generalizations of bent functions. A survey , 2011, IACR Cryptol. ePrint Arch..

[4]  P. Vijay Kumar,et al.  Generalized Bent Functions and Their Properties , 1985, J. Comb. Theory, Ser. A.

[5]  Natalia Tokareva.  Bent Functions: Results and Applications to Cryptography , 2015 .

[6]  Sihem Mesnager,et al.  On constructions of bent functions from involutions , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[7]  C. Moraga,et al.  On functions with flat Chrestenson spectra , 1989, Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic.

[8]  Peter Maurer,et al.  Spectral Logic And Its Applications For The Design Of Digital Devices , 2016 .