eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20120214:095906 of this paper.
See the latest version.
Paper 2011/400
On a generalized combinatorial conjecture involving addition $\mod 2^k - 1$
Gérard Cohen and 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.
Note: Corrected wrong formulation of our slight extension to the TCT conjecture. In particular, the TD conjecture is NOT included in the proved cases.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- combinatoricsadditionboolean functions
- Contact author(s)
- flori @ enst fr
- History
- 2012-02-14: revised
- 2011-07-28: received
- See all versions
- Short URL
- https://ia.cr/2011/400
- License
-
CC BY
