On a generalised combinatorial conjecture involving addition mod \(2^k-1\) (Q1664081): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:15, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a generalised combinatorial conjecture involving addition mod \(2^k-1\) |
scientific article |
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
