Welcome to the resource topic for 2011/400
Title:
On a generalized combinatorial conjecture involving addition \mod 2^k - 1
Authors: Gérard Cohen, Jean-Pierre Flori
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 generalization of the conjecture they propose.
ePrint: https://eprint.iacr.org/2011/400
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .