Binary and Multiple-Valued Bent Functions Stanković, Radomir S. creator author. aut http://id.loc.gov/vocabulary/relators/aut Stanković, Milena. author. aut http://id.loc.gov/vocabulary/relators/aut Moraga, Claudio. author. aut http://id.loc.gov/vocabulary/relators/aut Astola, Jaakko. author. aut http://id.loc.gov/vocabulary/relators/aut SpringerLink (Online service) text sz 2024 1st ed. 2024. monographic eng

electronic

electronic resource

access XIX, 272 p. 27 illus., 22 illus. in color. online resource. 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. 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. by Radomir S. Stanković, Milena Stanković, Claudio Moraga, Jaakko Astola. Electronic circuits Cryptography Data encryption (Computer science) Computers Electronic Circuits and Systems Cryptology Hardware Performance and Reliability TK7867-7867.5 9783031506505 https://doi.org/10.1007/978-3-031-50650-5 https://doi.org/10.1007/978-3-031-50650-5 240220 20251030111434.0 978-3-031-50650-5