Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
Meicheng Liu, Dongdai Lin, Dingyi Pei · IEEE Transactions on Information Theory · 2011
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.