Recursive weights for some Boolean functions
This paper studies degree 3 Boolean functions in n variables which are rotation symmetric, that is, invariant under any cyclic shift of the indices of the variables. These rotation symmetric functions have been extensively studied in the last dozen years or so because of their importance in cryptog...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2012-10-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc-2011-0020 |
| Summary: | This paper studies degree 3 Boolean functions in n variables which are rotation symmetric, that is, invariant under any cyclic shift of the indices of the variables. These rotation symmetric functions have
been extensively studied in the last dozen years or so because of their importance in cryptography. Let denote the (Hamming) weight of the Boolean function f. We extend and simplify results
of Bileschi, Cusick and Padgett, who gave an algorithm for finding a recursion for the sequence
, where
is the cubic rotation symmetric function generated by the monomial We show that the weights for the function
(note this is just the sum of the first terms in the definition of )
satisfy the same recursion as the weights for . We prove the recursion for the weights of by a method based on the work by Bileschi–Cusick–Padgett, but
we are able to avoid a lot of the complications in their proofs. In particular, we do not need the technical notion of “g terms” or the elaborate proof of similarity of certain matrices. |
|---|---|
| ISSN: | 1862-2976 1862-2984 |