[Resource Topic] 2006/180: Divisibility of the Hamming Weight by $2^k$ and Monomial Criteria for Boolean Functions

Welcome to the resource topic for 2006/180

Title:
Divisibility of the Hamming Weight by 2^k and Monomial Criteria for Boolean Functions

Authors: Dmitry Khovratovich

Abstract:

In this paper we consider the notions of the Hamming weight and the algebraic normal form. We solve an open problem devoted to checking divisibility of the weight by 2^k. We generalize the criterion for checking the evenness of the weight in two ways. Our main result states that for checking whether the Hamming weight of f is divisible by 2^k, \,k>1, it is necessary and sufficient to know its algebraic normal form accurate to an additive constant.

ePrint: https://eprint.iacr.org/2006/180

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .