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. A detailed theory of equivalence of quartic MRS 2-functions in 2n variables was given in a 2020 paper by Cusick, Cheon and Dougan. This theory divides naturally into two classes, called mf1 and mf2 in the paper. Next to describing the equivalence classes, the second major problem is giving details of the linear recursions that the Hamming weights for any sequence of functions 2-(1,q,r,s)2n (with q<r<s, say), n=s,s+1,… can be shown to satisfy. This problem was solved for the mf1 case only in the 2020 paper. In this paper the problem for the mf2 case is solved, using new ideas about short functions, as defined in this paper. These short functions are also of independent interest, and further results about them are in the paper.
| Original language | English |
|---|---|
| Pages (from-to) | 18-27 |
| Number of pages | 10 |
| Journal | Information Sciences |
| Volume | 547 |
| DOIs | |
| State | Published - Feb 8 2021 |
Keywords
- Affine equivalence
- Boolean function
- Cryptography
- Hamming weight
- Quartic
- Rotation symmetric
Fingerprint
Dive into the research topics of 'Weights for short quartic Boolean functions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver