The multiplicative complexity of 6-variable Boolean functions

The multiplicative complexity of a Boolean function is the minimum number of two-input AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR, NOT). Finding the multiplicative complexity of a given function is computationally intractable, even for functions with small number of inputs. Turan et al. [1] showed that n-variable Boolean functions can be implemented with at most n−1$n-1$ AND gates for n≤5$n\leq 5$. A counting argument can be used to show that, for n ≥ 7, there exist n-variable Boolean functions with multiplicative complexity of at least n. In this work, we propose a method to find the multiplicative complexity of Boolean functions by analyzing circuits with a particular number of AND gates and utilizing the affine equivalence of functions. We use this method to study the multiplicative complexity of 6-variable Boolean functions, and calculate the multiplicative complexities of all 150 357 affine equivalence classes. We show that any 6-variable Boolean function can be implemented using at most 6 AND gates. Additionally, we exhibit specific 6-variable Boolean functions which have multiplicative complexity 6.

[1]  Craig Gentry,et al.  (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.

[2]  Joanne Fuller,et al.  Analysis of affine equivalent boolean functions for cryptography , 2003 .

[3]  Elwyn R. Berlekamp,et al.  Weight distributions of the cosets of the (32, 6) Reed-Muller code , 1972, IEEE Trans. Inf. Theory.

[4]  James A. Maiorana.  A classification of the cosets of the Reed-Muller code R(1, 6) , 1991 .

[5]  Joan Boyar,et al.  On the multiplicative complexity of Boolean functions over the basis (cap, +, 1) , 2000, Theor. Comput. Sci..

[6]  Magnus Find.  On the Complexity of Computing Two Nonlinearity Measures , 2014, CSR.

[7]  René Peralta,et al.  The Multiplicative Complexity of Boolean Functions on Four and Five Variables , 2014, LightSec.

[8]  Michael Frank,et al.  When Six Gates are Not Enough , 2015, ArXiv.

[9]  G. Rota,et al.  On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions , 1970 .

[10]  Claude Carlet,et al.  Higher-Order Masking Schemes for S-Boxes , 2012, FSE.

[11]  D. Knuth.  Subspaces, subsets, and partitions , 1971 .

[12]  Bart Preneel,et al.  Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties , 2005, ICALP.

[13]  Ivan Damgård,et al.  Short Non-Interactive Cryptographic Proofs , 2015, Journal of Cryptology.

[14]  Xiang-dong Hou.  AGL(m, 2) Acting on R(r, m)/R(s, m) , 1995 .

[15]  Vladimir Kolesnikov,et al.  Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.

[16]  Joan Boyar,et al.  Tight bounds for the multiplicative complexity of symmetric functions , 2008, Theor. Comput. Sci..

[17]  J. Boyar,et al.  On the multiplicative complexity of Boolean functions over the basis ∧,⊕,1 , 1998 .

[18]  Claude Carlet,et al.  Boolean Functions for Cryptography and Error-Correcting Codes , 2010, Boolean Models and Methods.