A constructive count of rotation symmetric functions

DOI10.1016/J.IPL.2003.09.004zbMath1178.68237OpenAlexW2170858758MaRDI QIDQ1029033

Subhamoy Maitra, Pantelimon Stănică

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.09.004

zbMATH Keywords

cryptographycombinatorial problemsalgebraic normal formrotation symmetric Boolean functions

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (7)

Equivalence classes for cubic rotation symmetric functions ⋮ Constructing 1-resilient rotation symmetric functions over \(\mathbb{F}_p\) with \(q\) variables through special orthogonal arrays ⋮ Affine equivalence of cubic homogeneous rotation symmetric functions ⋮ Results on rotation symmetric polynomials over \(GF(p)\) ⋮ On homogeneous rotation symmetric bent functions ⋮ Affine equivalence for rotation symmetric Boolean functions with \(2^{k }\) variables ⋮ Enumeration of Homogeneous Rotation Symmetric Functions over F p

Cites Work

• Fast evaluation, weights and nonlinearity of rotation-symmetric functions
• Rotation Symmetric Boolean Functions –; Count and Cryptographic Properties
• Unnamed Item

This page was built for publication: A constructive count of rotation symmetric functions