Balanced Odd-Variable RSBFs with Optimum AI, High Nonlinearity and Good Behavior against FAAs

Abstract

Rotation symmetric Boolean functions which are invariant under the action of cyclic group have been used in many different cryptosystems. This paper presents a new construction of balanced odd-variable rotation symmetric Boolean functions with optimum algebraic immunity. It is checked that, at least for some small variables, such functions have very good behavior against fast algebraic attacks. Compared with some known rotation symmetric Boolean functions with optimum algebraic immunity, the new construction has really better nonlinearity. Further, the algebraic degree of the constructed functions is also high enough.