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

DOI10.1504/IJICOT.2017.10004697zbMATH Open1406.94053OpenAlexW2606630340WikidataQ122861263 ScholiaQ122861263MaRDI QIDQ1664081FDOQ1664081

Jean-Pierre Flori, Gérard 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

Recommendations

• On a combinatorial conjecture
• On a combinatorial conjecture of Tu and Deng
• On a Conjecture about Binary Strings Distribution
• A combinatorial condition and Boolean functions with optimal algebraic immunity
• Properties of a family of cryptographic Boolean functions

zbMATH Keywords

combinatoricsBoolean functionsTu-Deng conjecture

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (2)

• A modified combination rule for \(D\) numbers theory
• 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\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1664081)