Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have