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
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/400,
      author = {Gérard Cohen and Jean-Pierre Flori},
      title = {On a generalized combinatorial conjecture involving addition $\mod 2^k - 1$},
      howpublished = {Cryptology ePrint Archive, Paper 2011/400},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/400}},
      url = {https://eprint.iacr.org/2011/400}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.