[Resource Topic] 2012/210: On the Existence of Boolean Functions with Optimal Resistance against Fast Algebraic Attacks

Welcome to the resource topic for 2012/210

Title:
On the Existence of Boolean Functions with Optimal Resistance against Fast Algebraic Attacks

Authors: Yusong Du, Fangguo Zhang

Abstract:

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 \frac{n}{2} such that fg=h and \mathrm{deg}(g)+\mathrm{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.

ePrint: https://eprint.iacr.org/2012/210

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .