Recovering or Testing Extended-Affine Equivalence

26 Feb 2021 Anne Canteaut Alain Couvreur Léo Perrin

Extended Affine (EA) equivalence is the equivalence relation between two vectorial Boolean functions $F$ and $G$ such that there exist two affine permutations $A$, $B$, and an affine function $C$ satisfying $G = A \circ F \circ B + C$. While a priori simple, it is very difficult in practice to test whether two functions are EA-equivalent... (read more)

PDF Abstract

Categories


  • CRYPTOGRAPHY AND SECURITY
  • DISCRETE MATHEMATICS
  • INFORMATION THEORY
  • INFORMATION THEORY