000 03657nam a22005655i 4500
001 978-3-031-50650-5
003 DE-He213
005 20251030111434.0
007 cr nn 008mamaa
008 240220s2024 sz | s |||| 0|eng d
020 _a9783031506505
_9978-3-031-50650-5
024 7 _a10.1007/978-3-031-50650-5
_2doi
050 4 _aTK7867-7867.5
072 7 _aTJFC
_2bicssc
072 7 _aTEC008010
_2bisacsh
072 7 _aTJFC
_2thema
100 1 _aStanković, Radomir S.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_971396
245 1 0 _aBent Functions and Permutation Methods
_h[electronic resource] :
_bBinary and Multiple-Valued Bent Functions /
_cby Radomir S. Stanković, Milena Stanković, Claudio Moraga, Jaakko Astola.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXIX, 272 p. 27 illus., 22 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Engineering, Science, and Technology,
_x2690-0327
505 0 _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.
520 _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.
650 0 _aElectronic circuits.
650 0 _aCryptography.
_964299
650 0 _aData encryption (Computer science).
_958243
650 0 _aComputers.
_965793
650 1 4 _aElectronic Circuits and Systems.
650 2 4 _aCryptology.
_966491
650 2 4 _aHardware Performance and Reliability.
_971397
700 1 _aStanković, Milena.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_971398
700 1 _aMoraga, Claudio.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_971399
700 1 _aAstola, Jaakko.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_971400
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031506499
776 0 8 _iPrinted edition:
_z9783031506512
776 0 8 _iPrinted edition:
_z9783031506529
830 0 _aSynthesis Lectures on Engineering, Science, and Technology,
_x2690-0327
856 4 0 _uhttps://doi.org/10.1007/978-3-031-50650-5
912 _aZDB-2-SXSC
999 _c57746
_d57746