论文信息 - On a generalised combinatorial conjecture involving addition mod 2k - 1

On a generalised combinatorial conjecture involving addition mod 2k - 1

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.

Jean-Pierre Flori | Gérard D. Cohen

[1] Gérard D. Cohen,et al. On a Conjecture about Binary Strings Distribution , 2010, SETA.

[2] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[3] Hugues Randriam,et al. On the Number of Carries Occuring in an Addition mod 2k-1 , 2011, IACR Cryptol. ePrint Arch..

[4] Xiaohu Tang,et al. Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks , 2013, IEEE Transactions on Information Theory.

[5] Yingpu Deng,et al. A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity , 2011, Des. Codes Cryptogr..