Rotation Symmetric Boolean Functions - Count and Cryptographic Properties.

摘要

Rotation symmetric (RotS) Boolean functions have been used as components of different cryptosystems. This class of Boolean functions are invariant under circular translation of indices. In this paper, we find the number of short and long cycles of elements in Fn2 having fixed weight, under the RotS action. As a consequence, we obtain the number of homogeneous RotS functions having algebraic degree w. Our results make the search space of RotS functions much reduced and we successfully analyzed important cryptographic properties of such functions by executing computer programs. We study RotS bent functions up to 10 variables by computer search for correlation immunity and propagation characteristics and found some functions with very good cryptographic properties which were not known earlier. g(n) = 1/n Sigma(t).