2000 character limit reached
Rotation Symmetric Bent Boolean Functions for n = 2p (1708.09313v1)
Published 30 Aug 2017 in cs.IT and math.IT
Abstract: It has been conjectured that there are no homogeneous rotation symmetric bent Boolean functions of degree greater than two. In this paper we begin by proving that sums of short-cycle rotation symmetric bent Boolean functions must contain a specific degree two monomial rotation symmetric Boolean function. We then prove most cases of the conjecture in n=2p, p>2 prime, variables and extend this work to the nonhomogeneous case.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.