Proof of a Conjecture about Rotation Symmetric Functions

2010/01/18 by Xiyong Zhang, Hua Guo, Zhang, Xiyong +3 · 1 citation
Computer Science · Engineering · #Coding theory and cryptography #Combinatorics (math.CO) #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1001.2942

openalex publication_date 2010/01/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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ănică is proved. As a result, the nonlinearity of such kind of functions is determined.

Cited by

• Scalable tests of quantum contextuality from stabilizer-testing nonlocal games

Related

• Rotation Symmetric Bent Boolean Functions for n = 2p
• Fast Evaluation, Weights and Nonlinearity of Rotation-Symmetric\n Functions
• 9-variable Boolean Functions with Nonlinearity 242 in the Generalized Rotation Class
• A New Angle: On Evolving Rotation Symmetric Boolean Functions
• Permutation rotation-symmetric S-boxes, liftings and affine equivalence