Advertisement
Published in:
2012 | OriginalPaper | Chapter
Computing the Weight of a Boolean Function from Its Algebraic Normal Form
Authors : Çağdaş Çalık, Ali Doğanaksoy
Published in: Sequences and Their Applications – SETA 2012
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We present an algorithm that computes the weight of a Boolean function from its Algebraic Normal Form (ANF). For functions acting on high number of variables (
n
> 30) and having low number of monomials in its ANF, the algorithm is advantageous over the standard method of computing weight which requires the transformation of function’s ANF to its truth table with a complexity of
$\mathcal{O}(n2^n)$
operations. A relevant attempt at computing the Walsh coefficients of a function from its ANF by Gupta and Sarkar required the function to be composed of high degree monomials [1]. The proposed algorithm overcomes this limitation for particular values of
n
, enabling the weight and Walsh coefficient computation for functions that could be of more interest for practical applications.