Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large n

Although several methods for estimating the resistance of a random Boolean function against (fast) algebraic attacks were proposed, these methods are usually infeasible in practice for relatively large number of input variables n (for instance n ≥ 30) due to increased computational complexity. An efficient estimation of the resistance of Boolean functions, with relatively large number of inputs n, against (fast) algebraic attacks appears to be a rather difficult task. In this paper, the concept of partial linear relations decomposition is introduced, which decomposes any given nonlinear Boolean function into many linear (affine) subfunctions by using the disjoint sets of input variables. Based on this result, a general probabilistic decomposition algorithm for nonlinear Boolean functions is presented which gives a new framework for estimating the resistance of Boolean function against (fast) algebraic attacks. It is shown that our new probabilistic method gives very tight estimates (lower and upper bound) and it only requires about O(n22n) operations for a random Boolean function with n variables, thus having much less time complexity than previously known algorithms.