On the Existence of Boolean Functions with Optimal Resistance against Fast Algebraic Attacks.
Yusong Du, Fangguo Zhang · IACR Cryptology ePrint Archive · 2012
It has been pointed out that an n-variable Boolean function f has optimal resistance against fast algebraic attacks if and only if there does not exist a nonzero n-variable Boolean function g of degree lower than n 2 such that fg = h and deg(g) + deg(h) < n. In this corresponding, we show that there does not exist an n-variable Boolean function with optimal resistance against fast algebraic attacks for most values of n.