Title: Verification of Restricted EA-Equivalence for Vectorial Boolean Functions
Abstract: We present algorithms for solving the restricted extended affine equivalence (REA-equivalence) problem for any m-dimensional vectorial Boolean functions in n variables. The best of them has complexity O(22n + 1) for REA-equivalence F(x) = M 1 ·G(x ⊕ V 2) ⊕ M 3 ·x ⊕ V 1. The algorithms are compared with previous effective algorithms for solving the linear and the affine equivalence problem for permutations by Biryukov et. al [1].