Affine equivalence for quadratic rotation symmetric Boolean functions

From MaRDI portal
Publication:780372

DOI10.1007/S10623-020-00748-5zbMATH Open1457.94251arXiv1908.08448OpenAlexW3013592423MaRDI QIDQ780372FDOQ780372

Thomas W. Cusick, Alexandru Chirvasitu

Publication date: 15 July 2020

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

Abstract: Let fn(x0,x1,ldots,xn1) denote the algebraic normal form (polynomial form) of a rotation symmetric (RS) Boolean function of degree d in ngeqd variables and let wt(fn) denote the Hamming weight of this function. Let (0,a1,ldots,ad1)n denote the function fn of degree d in n variables generated by the monomial x0xa1cdotsxad1. Such a function fn is called monomial rotation symmetric (MRS). It was proved in a 2012 paper that for any MRS fn with d=3, the sequence of weights wk=wt(fk):k=3,4,ldots satisfies a homogeneous linear recursion with integer coefficients. This result was gradually generalized in the following years, culminating around 2016 with the proof that such recursions exist for any rotation symmetric function fn. Recursions for quadratic RS functions were not explicitly considered, since a 2009 paper had already shown that the quadratic weights themselves could be given by an explicit formula. However, this formula is not easy to compute for a typical quadratic function. This paper shows that the weight recursions for the quadratic RS functions have an interesting special form which can be exploited to solve various problems about these functions, for example, deciding exactly which quadratic RS functions are balanced.


Full work available at URL: https://arxiv.org/abs/1908.08448





Cites Work


Cited In (8)






This page was built for publication: Affine equivalence for quadratic rotation symmetric Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780372)