Affine equivalence for rotation symmetric Boolean functions with \(2^{k }\) variables

DOI10.1007/s10623-011-9553-6zbMath1254.06009OpenAlexW2051491799MaRDI QIDQ766242

Thomas W. Cusick, Younhwan Cheon

Publication date: 23 March 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9553-6

zbMATH Keywords

Boolean functionsrotation symmetryaffine equivalencecubic functionpatterns method

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Related Items (10)

Counting equivalence classes for monomial rotation symmetric Boolean functions with prime dimension ⋮ Constructions of rotation symmetric bent functions with high algebraic degree ⋮ Finding Hamming weights without looking at truth tables ⋮ Equivalence classes for cubic rotation symmetric functions ⋮ Counting permutation equivalent degree six binary polynomials invariant under the cyclic group ⋮ Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables ⋮ Affine equivalence for cubic rotation symmetric Boolean functions with \(n=pq\) variables ⋮ Affine equivalence of quartic monomial rotation symmetric Boolean functions in prime power dimension ⋮ Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions ⋮ Testing Boolean Functions Properties

Cites Work

• Affine equivalence of cubic homogeneous rotation symmetric functions
• On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2
• A constructive count of rotation symmetric functions
• Fast evaluation, weights and nonlinearity of rotation-symmetric functions

This page was built for publication: Affine equivalence for rotation symmetric Boolean functions with \(2^{k }\) variables