Affine equivalence for quadratic rotation symmetric Boolean functions (Q780372)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Affine equivalence for quadratic rotation symmetric Boolean functions
    scientific article

      Statements

      Affine equivalence for quadratic rotation symmetric Boolean functions (English)
      0 references
      0 references
      0 references
      15 July 2020
      0 references
      A function \(f\) from \(\mathbb{F}_2^n\) to \(\mathbb{F}_2\) is called rotation symmetric (RS) if \(f(x_0,x_1,\ldots,x_{n-1}) = f(x_1,\ldots,x_{n-1},x_0)\) for all \((x_0,x_1,\ldots,x_{n-1})\in\mathbb{F}_2^n\). An RS function \(f\) is called monomial rotation symmetric (MRS) if \(f\) is generated by a monomial (the algebraic normal form of \(f\) consists of the shifts of one monomial). The authors investigate a recursion formula for the weights of quadratic RS functions. As application, the authors show statements on balancedness of quadratic RS functions, the number of affine equivalence classes of quadratic MRS functions is given.
      0 references
      Boolean function
      0 references
      rotation symmetric
      0 references
      Hamming weight
      0 references
      recursion
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references