Paper 2011/400 Original: eprint.iacr.org/2011/400 ↗
On a generalized combinatorial conjecture involving addition $\mod 2^k - 1$
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2012-02-14: last updated
- 2011-07-28: published
- Short URL
- https://ia.cr/2011/400
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2011/400}
}