Properties and constructions of coincident functions

Extensive studies of Boolean functions are carried in many fields. The Mobius transform is often involved for these studies. In particular, it plays a central role in coincident functions, the class of Boolean functions invariant by this transformation. This class – which has been recently introduced – has interesting properties, in particular if we want to control both the Hamming weight and the degree. We propose an innovative way to handle the Mobius transform which allows the composition between several Boolean functions and the use of Shannon or Reed-Muller decompositions. Thus we benefit from a better knowledge of coin-cident functions and introduce new properties. We show experimentally that for many features, coincident functions look like any Boolean functions.

[1]  Philippe Guillot Fonctions courbes binaires et transformation de mobius , 1999 .

[2]  Tadao Kasami,et al.  On the weight structure of Reed-Muller codes , 1970, IEEE Trans. Inf. Theory.

[3]  Peter L. Hammer,et al.  Boolean Models and Methods in Mathematics, Computer Science, and Engineering , 2010, Boolean Models and Methods.

[4]  Anne Canteaut,et al.  Symmetric Boolean functions , 2005, IEEE Transactions on Information Theory.

[5]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[6]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[7]  Xian-Mo Zhang,et al.  Möbius transforms, coincident Boolean functions and non-coincidence property of Boolean functions , 2011, Int. J. Comput. Math..

[8]  R. W. Robinson,et al.  Balancing the n-Cube: A Census of Colorings , 1992 .

[9]  George Boole,et al.  An Investigation of the Laws of Thought: Frontmatter , 2009 .

[10]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[11]  George Boole,et al.  The Calculus of Logic , 2001 .

[12]  Thomas Siegenthaler,et al.  Correlation-immunity of nonlinear combining functions for cryptographic applications , 1984, IEEE Trans. Inf. Theory.

[13]  Vladimir V. Chepyzhov,et al.  On A Fast Correlation Attack on Certain Stream Ciphers , 1991, EUROCRYPT.

[14]  Anne Canteaut,et al.  Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5 , 2000, EUROCRYPT.