Answers are grounded in this paper and cite their sources.
In this correspondence, first we give a decomposition of symmetric Boolean functions, then we show that almost all symmetric Boolean functions, including these functions with good algebraic immunity, behave badly against fast algebraic attacks. Besides, we improve the relations between algebraic degree and algebraic immunity of symmetric Boolean functions.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: