03363nam a22005055i 4500001001800000003000900018005001700027007001500044008004100059020001800100024003500118050001800153072001700171072002300188072001600211100008500227245019200312250001800504264006900522300006500591336002600656337002600682338003600708347002400744490007500768505046700843520082801310650002502138650001802163650004002181650001502221650003702236650001602273650004202289700008202331700007802413700007702491710003402568773002602602776003602628776003602664776003602700830007502736856004602811978-3-031-50650-5DE-He21320251030111434.0cr nn 008mamaa240220s2024    sz |    s    |||| 0|eng d  a97830315065057 a10.1007/978-3-031-50650-52doi 4aTK7867-7867.5 7aTJFC2bicssc 7aTEC0080102bisacsh 7aTJFC2thema1 aStanković, Radomir S.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut10aBent Functions and Permutation Methodsh[electronic resource] :bBinary and Multiple-Valued Bent Functions /cby Radomir S. Stanković, Milena Stanković, Claudio Moraga, Jaakko Astola.  a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Springer,c2024.  aXIX, 272 p. 27 illus., 22 illus. in color.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aSynthesis Lectures on Engineering, Science, and Technology,x2690-03270 aBasic 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.  aThis 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. 0aElectronic circuits. 0aCryptography. 0aData encryption (Computer science). 0aComputers.14aElectronic Circuits and Systems.24aCryptology.24aHardware Performance and Reliability.1 aStanković, Milena.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut1 aMoraga, Claudio.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut1 aAstola, Jaakko.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut2 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303150649908iPrinted edition:z978303150651208iPrinted edition:z9783031506529 0aSynthesis Lectures on Engineering, Science, and Technology,x2690-032740uhttps://doi.org/10.1007/978-3-031-50650-5