Verification of restricted EA-equivalence for vectorial boolean functions
L. Budaghyan,
O. Kazymyrov
Системи обробки інформації.
— 2013. — № 1(108). — С. 155-160.
Тематика статті: Математичні моделі та методи
УДК 621.3.06
Мова статті:
англійська
Анотації на мовах:
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 2n 1O(2 ) for REA- equivalence 1 2 3 1F(x) M G(x V ) M x V . The algorithms are compared with previous effective algorithms for solving the linear and the affine equivalence problem for permutations by Biryukov et. al.
Ключові слова: EA-equivalence, matrix representation, S-box, vectorial Boolean function
Інформація про авторів публікації:
Reference:
Budaghyan, L. and Kazymyrov, O. (2013), Verification of restricted EA-equivalence for vectorial boolean functions, Information Processing Systems, No. 1(108), pp. 155-160
Budaghyan, L. and Kazymyrov, O. (2013), Verification of restricted EA-equivalence for vectorial boolean functions, Information Processing Systems, No. 1(108), pp. 155-160