Ivan Kozhedub Kharkiv National Air Force University (KNAFU)

Annotation: 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.

Keywords: EA-equivalence, matrix representation, S-box, vectorial Boolean function

Full text PDF - 698.45 KB

Quotation of the public

Information about the authors of publication:

• Budaghyan L.
• Kazymyrov O.

Reference:
Budaghyan, L. and Kazymyrov, O. (2013), Verification of restricted EA-equivalence for vectorial boolean functions, Information Processing Systems, Vol. 1(108), pp. 155-160.