Counting equivalence classes for monomial rotation symmetric Boolean functions with prime dimension

DOI10.1007/s12095-015-0143-8zbMath1344.94105OpenAlexW983007869MaRDI QIDQ267798

Thomas W. Cusick, Pantelimon Stănică

Publication date: 11 April 2016

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-015-0143-8

zbMATH Keywords

permutationsBoolean functionsprime numbersaffine equivalencerotation symmetric

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items

Constructions of rotation symmetric bent functions with high algebraic degree, Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach, Counting permutation equivalent degree six binary polynomials invariant under the cyclic group

Cites Work

• Unnamed Item
• Unnamed Item
• Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables
• Affine equivalence of cubic homogeneous rotation symmetric functions
• Affine equivalence for rotation symmetric Boolean functions with \(2^{k }\) variables
• Affine equivalence of quartic homogeneous rotation symmetric Boolean functions
• Rotation symmetric Boolean functions-count and cryptographic properties
• Fast evaluation, weights and nonlinearity of rotation-symmetric functions
• Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions
• Multiplicative Number Theory I
• Splitting of Quartic Polynomials
• Fundamentals of Error-Correcting Codes
• Isomorphism problem for a class of point-symmetric structures