Finding periods of Zhegalkin polynomials

Abstract A period of a Boolean function f(x1, …, xn) is a binary n-tuple a = (a1, …, an) that satisfies the identity f(x1 + a1, …, xn + an) = f(x1, …, xn). A Boolean function is periodic if it admits a nonzero period. We propose an algorithm that takes the Zhegalkin polynomial of a Boolean function f(x1, …, xn) as the input and finds a basis of the space of all periods of f(x1, …, xn). The complexity of this algorithm is nO(d), where d is the degree of the function f. As a corollary we show that a basis of the space of all periods of a Boolean function specified by the Zhegalkin polynomial of a bounded degree may be found with complexity which is polynomial in the number of variables.