Affine equivalence for rotation symmetric Boolean functions with 2 k variables
Rotation symmetric Boolean functions have been extensively studied in the last 10 years or so because of their importance in cryptography and coding theory. Until recently, very little was known about the basic question of when two such functions are affine equivalent. Even the case of quadratic functions is nontrivial, and this was only completely settled in a 2009 paper of Kim, Park and Hahn. The much more complicated case of cubic functions was solved for permutations using a new concept of patterns in a 2010 paper of Cusick, and it is conjectured that, as in the quadratic case, this solution actually applies for all affine transformations. The patterns method enables a detailed analysis of the affine equivalence classes for various special classes of cubic rotation symmetric functions in n variables. Here the case of functions with 2 k variables (this number is especially relevant in computer applications) and generated by a single monomial is examined in detail, and in particular a formula for the number of classes is proved.
KeywordsBoolean functions Rotation symmetry Cubic function Affine equivalence Patterns
Mathematics Subject Classification (2000)94C10 94A15 06E30
Unable to display preview. Download preview PDF.
- 3.Cusick T.W., Stănică P.: Cryptographic Boolean Functions and Applications. Academic Press, San Diego (2009)Google Scholar