Affine equivalence for quadratic rotation symmetric Boolean functions

Abstract

Let $$f_n(x_0, x_1, \ldots , x_{n-1})$$ denote the algebraic normal form (polynomial form) of a rotation symmetric (RS) Boolean function of degree d in $$n \ge d$$ variables and let $$wt(f_n)$$ denote the Hamming weight of this function. Let $$(0, a_1, \ldots , a_{d-1})_n$$ denote the function $$f_n$$ of degree d in n variables generated by the monomial $$x_0x_{a_1} \ldots x_{a_{d-1}}.$$ Such a function $$f_n$$ is called monomial rotation symmetric (MRS). It was proved in a 2012 paper that for any MRS $$f_n$$ with $$d=3,$$ the sequence of weights $$\{w_k = wt(f_k):~k = 3, 4, \ldots \}$$ satisfies a homogeneous linear recursion with integer coefficients. This result was gradually generalized in the following years, culminating around 2016 with the proof that such recursions exist for any rotation symmetric function $$f_n.$$ Recursions for quadratic RS functions were not explicitly considered, since a 2009 paper had already shown that the quadratic weights themselves could be given by an explicit formula. However, this formula is not easy to compute for a typical quadratic function. This paper shows that the weight recursions for the quadratic RS functions have an interesting special form which can be exploited to solve various problems about these functions, for example, deciding exactly which quadratic RS functions are balanced.