On a generalized combinatorial conjecture involving addition $\mod 2^k - 1$

Gérard Cohen (1) , Jean-Pierre Flori (1)

1 LTCI - Laboratoire Traitement et Communication de l'Information

In this note, we give a simple proof of the combinatorial conjecture proposed by Tang, Carlet and Tang, based on which they constructed two classes of Boolean functions with many good cryptographic properties. We also give more general properties about the generalization of the conjecture they propose.

Domaines: Cryptographie et sécurité [cs.CR]

Gérard Cohen, Jean-Pierre Flori. On a generalized combinatorial conjecture involving addition $\mod 2^k - 1$. 2011. ⟨hal-00642287⟩