Multiaffinity Testing of Boolean Functions Using Their Zhegalkin Polynomials
Светлана Николаевна Селезнева · Moscow University Computational Mathematics and Cybernetics · 2022
Abstract A polynomial algorithm is proposed for testing the multiaffinity of Boolean functions determined by Zhegalkin polynomials. The multiaffinity of functions is verified more easily using this algorithm than with other well-known algorithms for solving this problem.