Title: On a generalised combinatorial conjecture involving addition mod 2k – 1

Authors: Jean-Pierre Flori; Gérard Cohen

Addresses: Agence nationale de la sécurité des systémes d'information, 51, boulevard de La Tour-Maubourg, 75700 Paris SP 07, France ' Télécom ParisTech, CNRS LTCI 46, rue Barrault, F-75634 Paris cedex 1, France

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 generalisation of the conjecture they propose.

Keywords: Boolean functions; combinatorics; Tu-Deng conjecture.

DOI: 10.1504/IJICOT.2017.083831

International Journal of Information and Coding Theory, 2017 Vol.4 No.2/3, pp.107 - 115

Received: 15 Sep 2016
Accepted: 20 Sep 2016

Published online: 20 Apr 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article