On a generalised combinatorial conjecture involving addition mod \(2^k-1\) (Q1664081)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a generalised combinatorial conjecture involving addition mod 2ᵏ-1 |
scientific article; zbMATH DE number 6924904
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a generalised combinatorial conjecture involving addition mod \(2^k-1\) |
scientific article; zbMATH DE number 6924904 |
Statements
On a generalised combinatorial conjecture involving addition mod \(2^k-1\) (English)
0 references
24 August 2018
0 references
Summary: In this note, we give a simple proof of the combinatorial conjecture proposed by \textit{D. Tang}, \textit{C. Carlet} and \textit{X. Tang} [IEEE Trans. Inf. Theory 59, No. 1, 653--664 (2013; Zbl 1364.94808)], 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.
0 references
Boolean functions
0 references
combinatorics
0 references
Tu-Deng conjecture
0 references
