TY  - BOOK
AU  - Stanković,Radomir S.
AU  - Stanković,Milena
AU  - Moraga,Claudio
AU  - Astola,Jaakko
ED  - SpringerLink (Online service)
TI  - Bent Functions and Permutation Methods: Binary and Multiple-Valued Bent Functions 
T2  - Synthesis Lectures on Engineering, Science, and Technology,
SN  - 9783031506505
AV  - TK7867-7867.5 
PY  - 2024///
CY  - Cham
PB  - Springer Nature Switzerland, Imprint: Springer
KW  - Electronic circuits
KW  - Cryptography
KW  - Data encryption (Computer science)
KW  - Computers
KW  - Electronic Circuits and Systems
KW  - Cryptology
KW  - Hardware Performance and Reliability
N1  - Basic Concepts and Notations -- Gibbs Derivatives on Finite Abelian Groups -- Gibbs Characterization of Binary Bent Functions -- Gibbs Characterisation of Ternary Bent Functions -- Gibbs Characterization of a Class of Quaternary Bent Functions -- Matrix-valued Binary Bent Functions -- Matrix-valued Ternary Bent Functions -- Construction of Bent Functions by FFT-like Permutation Matrices -- Construction of Ternary Bent Functions Trough Matrix Representations
N2  - This book discusses in a uniform way binary, ternary, and quaternary bent functions, while most of the existing books on bent functions refer to just binary bent functions. The authors describe the differences between binary and multiple-valued cases and the construction methods for bent functions are focused on the application of two types of permutation matrices. These matrices are derived from a class of differential operators on finite groups and Fast Fourier transform algorithms, respectively. The approach presented is based on the observation that given certain bent functions, many other bent functions can be constructed by manipulating them. Permutations are possible manipulations that are easy to implement. These permutations perform spectral invariant operations which ensure that they preserve bentness
UR  - https://doi.org/10.1007/978-3-031-50650-5
ER  -