Proof of a Combinatoric Conjecture

Abstract

AbstractIn [1], the authors proposed a combinatoric conjecture on binary string, and based on which they constructed two classes of Boolean functions with good cryptographic properties. In [2], the authors proved the conjecture in some cases and predicted that a general proof was difficult to obtain. In this paper, from a new viewpoint, we prove that the conjecture is true in general