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 Edit this on Wikidata


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 n 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




Cites Work


Cited In (28)





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)