## Cryptology ePrint Archive: Report 2012/111

On the Immunity of Rotation Symmetric Boolean Functions Against Fast Algebraic Attacks

Yin Zhang and Meicheng Liu and Dongdai Lin

Abstract: In this paper, it is shown that an $n$-variable rotation symmetric Boolean function $f$ with $n$ even but not a power of 2 admits a rotation symmetric function $g$ of degree at most $e\leq n/3$ such that the product $gf$ has degree at most $n-e-1$.

Category / Keywords: foundations / cryptography, Boolean functions, fast algebraic attacks, algebraic immunity, rotation symmetric