Computing Affine Equivalence Classes of Boolean Functions by Group Isomorphism

Affine equivalence classification of Boolean functions has significant applications in logic synthesis and cryptography. Previous studies for classification have been limited by the large set of Boolean functions and the complex operations on the affine group. Although there are many research on affine equivalence classification for parts of Boolean functions in recent years, there are very few results for the entire set of Boolean functions. The best existing result has been achieved by Harrison with 15768919 affine equivalence classes for 6-variable Boolean functions. This paper presents a concise formula for affine equivalence classification of the entire set of Boolean functions as well as a formula for affine classification of Boolean functions with distinct ON-set size respectively. The method outlined in this paper greatly simplifies the affine group's action by constructing an isomorphism mapping from the affine group to a permutation group. By this method, we can compute the affine equivalence classes for up to 10 variables. Experiment results indicate that our scheme for calculating the affine equivalence classes for more than 6 variables is a significant advancement over previous published methods.

[1]  Claudio Moraga,et al.  Optimization of Polynomial Expressions by Using the Extended Dual Polarity , 2009, IEEE Transactions on Computers.

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

[3]  M. Harrison.  On the Classification of Boolean Functions by the General Linear and Affine Groups , 1964 .

[4]  Daizhan Cheng,et al.  Bi-decomposition of multi-valued logical functions and its applications , 2013, Autom..

[5]  Bernard M. E. Moret,et al.  Symmetric and Threshold Boolean Functions Are Exhaustive , 1983, IEEE Transactions on Computers.

[6]  C.R. Edwards.  The Application of the Rademacher–Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis , 1975, IEEE Transactions on Computers.

[7]  Thomas W. Cusick,et al.  Affine equivalence of quartic homogeneous rotation symmetric Boolean functions , 2014, Inf. Sci..

[8]  H. Allen Curtis.  Simplified Decomposition of Boolean Functions , 1976, IEEE Transactions on Computers.

[9]  Malgorzata Marek-Sadowska,et al.  Boolean Functions Classification via Fixed Polarity Reed-Muller Forms , 1997, IEEE Trans. Computers.

[10]  Huanguo Zhang,et al.  Analysis of affinely equivalent Boolean functions , 2007, Science in China Series F: Information Sciences.

[11]  Alex Biryukov,et al.  A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms , 2003, EUROCRYPT.

[12]  Caroline Fontaine,et al.  On Some Cosets of the First-Order Reed-Muller Code with High Minimum Weight , 1999, IEEE Trans. Inf. Theory.

[13]  Alexander Hulpke,et al.  Conjugacy classes in finite permutation groups via homomorphic images , 2000, Math. Comput..

[14]  Peter R. Wilson.  Design Recipes for FPGAs , 2007 .

[15]  Rupak Majumdar,et al.  Exploiting Symmetries to Speed Up SAT-Based Boolean Matching for Logic Synthesis of FPGAs , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[16]  Ladislav A. Novak,et al.  A comment on "Boolean functions classification via fixed polarity Reed-Muller form" , 2006, IEEE Transactions on Computers.

[17]  Jie-Hong Roland Jiang,et al.  Boolean matching of function vectors with strengthened learning , 2010, 2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[18]  Yin Tan,et al.  Constructing Differentially 4-Uniform Permutations Over ${\BBF}_{2^{2k}}$ via the Switching Method , 2013, IEEE Transactions on Information Theory.

[19]  Xiang-dong Hou.  GL(m, 2) acting on R(r, m)/R(r-1, m) , 1996, Discret. Math..

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

[21]  Xiang-dong Hou.  Classification of cosets of the Reed-Muller code R(m-3, m) , 1994, Discret. Math..

[22]  Pantelimon Stanica.  Affine equivalence of quartic monomial rotation symmetric Boolean functions in prime power dimension , 2015, Inf. Sci..

[23]  D. Slepian.  On The Number of Symmetry Types of Boolean Functions of n Variables , 1953, Canadian Journal of Mathematics.

[24]  C. K. Yuen,et al.  Comments on "The Application of the Rademacher-Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis" , 1976, IEEE Trans. Computers.

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

[26]  I. Strazdins,et al.  Universal Affine Classification of Boolean Functions , 1997 .

[27]  Wenfen Liu,et al.  Constructions of Quadratic and Cubic Rotation Symmetric Bent Functions , 2012, IEEE Transactions on Information Theory.

[28]  Nripendra N. Biswas,et al.  On Identification of Totally Symmetric Boolean Functions , 1970, IEEE Transactions on Computers.

[29]  Peter R. Wilson.  Design Recipes for FPGAs:Using Verilog and VHDL (Embedded Technology) , 2007 .

[30]  Y. Tan,et al.  Constructing Differentially 4-Uniform Permutations Over via the Switching Method Longjiang Qu, Yin Tan, Chik How Tan, and Chao Li , 2013 .

[31]  Jason Cong,et al.  Boolean matching for LUT-based logic blocks with applications toarchitecture evaluation and technology mapping , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[32]  Fabrizio Luccio,et al.  On a New Boolean Function with Applications , 1999, IEEE Trans. Computers.