Answers are grounded in this paper and cite their sources.
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 generalisation of the conjecture they propose.
No takes yet. Share an insight, caveat, or question.
Cohen et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: