Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chand Gupta, K., Sarkar, P.: Computing partial walsh transform from the algebraic normal form of a boolean function. IEEE Transactions on Information Theory 55(3), 1354–1359 (2009)
MacWillians, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland (1977)
Hell, M., Johansson, T., Meier, W.: A stream cipher proposal: Grain-128. eSTREAM, ECRYPT Stream Cipher Project (2006), http://www.ecrypt.eu.org/stream/grainp3.html
Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257–397. Cambridge University Press (2010)
Filiol, E.: Designs, Intersecting Families, and Weight of Boolean Functions. In: Walker, M. (ed.) Cryptography and Coding 1999. LNCS, vol. 1746, pp. 70–80. Springer, Heidelberg (1999)
Carlet, C., Guillot, P.: A New Representation of Boolean Functions. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds.) AAECC 1999. LNCS, vol. 1719, pp. 94–103. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Çalık, Ç., Doğanaksoy, A. (2012). Computing the Weight of a Boolean Function from Its Algebraic Normal Form. In: Helleseth, T., Jedwab, J. (eds) Sequences and Their Applications – SETA 2012. SETA 2012. Lecture Notes in Computer Science, vol 7280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30615-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-30615-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30614-3
Online ISBN: 978-3-642-30615-0
eBook Packages: Computer ScienceComputer Science (R0)