Abstract
A Boolean function in n variables is 2-rotation symmetric if it is invariant under even powers of ρ(x1,……,xn)=(x2,…,xn,x1), but not under the first power (ordinary rotation symmetry); we call such a function a 2-function. A 2-function is called monomial rotation symmetric (MRS) if it is generated by applying powers of ρ2 to a single monomial. If the quartic MRS 2-function in 2n variables has a monomial x1xqxrxs, then we use the notation 2-(1, q, r, s)2n for the function. This paper gives a detailed theory of equivalence of quartic MRS 2-functions in 2n variables. Such a theory was provided for the cubic MRS 2-functions in two 2015 papers of Cusick and Johns. As in the earlier papers, the two main topics in the theory are describing the affine equivalence classes of the functions under certain groups of permutations; and giving details of the linear recursions that the Hamming weights of any sequence of functions 2-(1, q, r, s)2n (with q < r < s, say), n=s,s+1,… can be shown to satisfy. The discussion for both of these topics uses new ideas because the quartic theory naturally divides into two cases.
| Original language | English |
|---|---|
| Pages (from-to) | 358-379 |
| Number of pages | 22 |
| Journal | Information Sciences |
| Volume | 508 |
| DOIs | |
| State | Published - Jan 2020 |
Keywords
- Affine equivalence
- Boolean function
- Cryptography
- Hamming weight
- Quartic
- Rotation symmetric
Fingerprint
Dive into the research topics of 'Equivalence of 2-rotation symmetric quartic Boolean functions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver