2000 character limit reached
Proof of a Conjecture about Rotation Symmetric Functions
Published 18 Jan 2010 in cs.CR, cs.DM, and math.CO | (1001.2942v2)
Abstract: Rotation symmetric Boolean functions have important applications in the design of cryptographic algorithms. In this paper, the Conjecture about rotation symmetric Boolean functions (RSBFs) of degree 3 proposed by Cusik and St\u{a}nic\u{a} is proved. As a result, the nonlinearity of such kind of functions is determined.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.