Affine equivalence classes of 2-rotation symmetric cubic Boolean functions. Issue 3 (3rd July 2018)

• Record Type: Journal Article
• Authors: Reid, Elizabeth M.; Cusick, Thomas W.
• Is Part Of: International journal of computer mathematics. Volume 3:Issue 3(2018)
• Page Start: 145
• Page End: 159
• Publication Date: 2018-07-03
• Subjects: Boolean function -- rotation symmetric -- affine equivalence -- recursion -- cryptography; 94C10 -- 94A60 -- 06E30; Computer systems -- Periodicals; Computer systems; Periodicals; 004
• DOI: 10.1080/23799927.2018.1499496
• Languages: English
• ISSNs: 2379-9927

Abstract

ABSTRACT: A Boolean function in variables that is generated by applying all even powers of the cyclic permutation of the variables to a single cubic monomial is called a cubic monomial rotation symmetric 2-function (or cubic 2-MRS function for short). In 2015, Cusick and Johns gave a complete description of the affine equivalence classes for such functions with generating monomial with 1< r < s and r and s not both odd. In this paper we develop the theory further by determining the smallest sets that act on the set of all these cubic 2-MRS functions to give the affine equivalence classes. Also, suppose f and g are two of these functions such that there exists a permutation σ of the variables where We give a complete description of all such permutations σ and an exact count of their number.