No label defined (Q3136951)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 426131
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 426131

      Statements

      0 references
      23 January 1995
      0 references
      bent permutation
      0 references
      finite field
      0 references
      bent function
      0 references
      Boolean function
      0 references
      Hamming distance
      0 references
      A bent function is a Boolean function \(f(x)\) from \(\mathbb{F}^ n_ 2\) to \(\mathbb{F}_ 2\) whose Fourier coefficients of \((-1)^{f(x)}\) are \(\pm 1\). The nonlinearity of a Boolean function is defined as the Hamming distance between the function and the set of all linear functions. It was proved that bent functions have the maximum nonlinearity. Bent functions exist in \(\mathbb{F}_{2^ n}\) if and only if \(n\) is even. The notion of bent permutations has been introduced in this paper. A permutation \(p(x) = (p_ 1(x), \dots, p_ n (x))\) in \(\mathbb{F}_{2^ n}\) is called bent if all components \(p_ i (x)\) \((1 \leq i \leq n)\) and all components of its inverse permutation \(p^{-1} (x) =(p^{-1}_ 1(x), \dots, p^{-1}_ n(x))\) share the same nonlinearity with bent functions in \(\mathbb{F}_{2^{n-1}}\). It is proved here that all permutations \(p(x) = \chi^{2^ i + 1}\) in \(\mathbb{F}_{2^ n}\) \((n\) is odd) are bent provided \(i\) and \(n\) are relatively prime. For the entire collection see [Zbl 0771.00039].
      0 references

      Identifiers