Computing the Weight of a Boolean Function from Its Algebraic Normal Form

  • Çağdaş Çalık
  • Ali Doğanaksoy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7280)

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.

Keywords

Boolean Functions Algebraic Normal Form Weight 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    MacWillians, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland (1977)Google Scholar
  3. 3.
    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
  4. 4.
    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)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Çağdaş Çalık
    • 1
  • Ali Doğanaksoy
    • 1
    • 2
  1. 1.Institute of Applied MathematicsMiddle East Technical UniversityAnkaraTurkey
  2. 2.Department of MathematicsMiddle East Technical UniversityAnkaraTurkey

Personalised recommendations