On a generalised combinatorial conjecture involving addition mod \(2^k-1\)

DOI10.1504/IJICOT.2017.10004697zbMath1406.94053OpenAlexW2606630340WikidataQ122861263 ScholiaQ122861263MaRDI QIDQ1664081

Jean-Pierre Flori, Gérard D. Cohen

Publication date: 24 August 2018

Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL: https://eprint.iacr.org/2011/400.pdf

zbMATH Keywords

combinatoricsBoolean functionsTu-Deng conjecture

Mathematics Subject Classification ID

Related Items (1)

A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost

This page was built for publication: On a generalised combinatorial conjecture involving addition mod \(2^k-1\)