Equivalence classes for cubic rotation symmetric functions

  • Authors:
  • Alyssa Brown;Thomas W. Cusick

  • Affiliations:
  • University at Buffalo (SUNY Buffalo), Buffalo, USA;University at Buffalo (SUNY Buffalo), Buffalo, USA

  • Venue:
  • Cryptography and Communications
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rotation symmetric Boolean functions, that is, Boolean functions which are invariant under any cyclic permutation of the variables, have been extensively studied in the last dozen years or so due to their importance in cryptography and coding theory. Little was known about the basic question of when two such functions are affine equivalent until very recently. The case of affine equivalence of quadratic rotation symmetric functions was solved in 2009 by Kim, Park and Hahn. In 2010, Cusick introduced the concept of patterns to study the more complicated case of cubic functions under permutations. This method made possible a detailed analysis of some special classes of cubic rotation symmetric functions in n variables where n has a special form, for example, n equal to a prime power. Here the affine equivalence classes under permutations in n variables for any n are examined. In particular, all possible sizes of these classes are identified and an exact count of the functions in the largest classes is given. It is conjectured that the classes of the largest size contain a positive proportion of all of the distinct functions in n variables.