Affine equivalence of cubic homogeneous rotation symmetric functions
From MaRDI portal
Publication:429599
DOI10.1016/J.INS.2011.07.002zbMATH Open1272.94026arXiv1007.1938OpenAlexW3031060042MaRDI QIDQ429599FDOQ429599
Authors: Thomas W. Cusick
Publication date: 20 June 2012
Published in: Information Sciences (Search for Journal in Brave)
Abstract: Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The simplest case of quadratic rotation symmetric functions which are generated by cyclic permutations of the variables in a single monomial was only settled in 2009. This paper studies the much more complicated cubic case for such functions. A new concept of emph{patterns} is introduced, by means of which the structure of the smallest group G_n, whose action on the set of all such cubic functions in variables gives the affine equivalence classes for these functions under permutation of the variables, is determined. We conjecture that the equivalence classes are the same if all nonsingular affine transformations, not just permutations, are allowed. This conjecture is verified if n < 22. Our method gives much more information about the equivalence classes; for example, in this paper we give a complete description of the equivalence classes when n is a prime or a power of 3.
Full work available at URL: https://arxiv.org/abs/1007.1938
Recommendations
- Equivalence classes for cubic rotation symmetric functions
- Affine equivalence for cubic rotation symmetric Boolean functions with \(n=pq\) variables
- Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables
- Permutation equivalence of cubic rotation symmetric Boolean functions
- Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach
Cites Work
- Title not available (Why is that?)
- Fast evaluation, weights and nonlinearity of rotation-symmetric functions
- Cryptographic Boolean functions and applications.
- Title not available (Why is that?)
- On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2
- Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class
- A constructive count of rotation symmetric functions
- Cubic bent functions
- Homogeneous bent functions, invariants, and designs
Cited In (28)
- Equivalence of 2-rotation symmetric quartic Boolean functions
- Counting equivalence classes for monomial rotation symmetric Boolean functions with prime dimension
- Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables
- Affine equivalence for cubic rotation symmetric Boolean functions with \(n=pq\) variables
- Counting rotation symmetric functions using Polya's theorem
- Affine equivalence for rotation symmetric Boolean functions with \(2^{k }\) variables
- Constructions of rotation symmetric bent functions with high algebraic degree
- Affine equivalence of quartic homogeneous rotation symmetric Boolean functions
- On the linear structures of balanced functions and quadratic APN functions
- Weights of Boolean cubic monomial rotation symmetric functions
- Quadratic rotation symmetric Boolean functions
- Theory of 3-rotation symmetric cubic Boolean functions
- A recursive formula for weights of Boolean rotation symmetric functions
- Linear codes and incidence structures of bent functions and their generalizations
- Finding Hamming weights without looking at truth tables
- Using easy coefficients conjecture for rotation symmetric Boolean functions
- Weights for short quartic Boolean functions
- Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions
- Counting permutation equivalent degree six binary polynomials invariant under the cyclic group
- Equivalence classes for cubic rotation symmetric functions
- Permutation equivalence of cubic rotation symmetric Boolean functions
- Affine equivalence for quadratic rotation symmetric Boolean functions
- Theory of 2-rotation symmetric cubic Boolean functions
- On the matrix of rotation symmetric Boolean functions
- On the affine classification of cubic bent functions
- Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach
- Recursion orders for weights of Boolean cubic rotation symmetric functions
- Affine equivalence of quartic monomial rotation symmetric Boolean functions in prime power dimension
This page was built for publication: Affine equivalence of cubic homogeneous rotation symmetric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429599)