HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information

# On a conjecture about binary strings distribution

Abstract : It is a difficult challenge to find Boolean functions used in stream ciphers achieving all of the necessary criteria and the research of such functions has taken a significant delay with respect to cryptanalyses. A lot of attacks has led to design criteria for these functions; mainly: balancedness, a high algebraic degree, a high nonlinearity, a good behavior against Fast Algebraic Attacks and also a high algebraic immunity (which is now an absolutely necessary criterion (but not sufficient) for cryptographic Boolean functions). Very recently, an infinite class of Boolean functions has been proposed by Tu and Deng having many very nice cryptographic properties under the assumption that the following combinatorial conjecture about binary strings is true: \begin{cjt} \label{cjt:original} Let $\Stk$ be the following set: $\Stk=\set{(a,b) \in \left(\Zk\right)^2 | a + b = t \text{ and } w(a) + w(b) < k} .$ Then: $\abs{\Stk} \leq 2^{k-1} .$ \end{cjt} The main contribution of the present paper is the reformulation of the problem in terms of {\em carries} which gives more insight on it than simple counting arguments. Successful applications of our tools include explicit formulas of $\abs{\Stk}$ for numbers whose binary expansion is made of one block (see theorem \ref{thm:one}), a proof that the conjecture is {\em asymptotically} true (see theorem \ref{thm:asymptotic}) and a proof that a family of numbers (whose binary expansion has a high number of \textttup{1}s and isolated \textttup{0}s) reaches the bound of the conjecture (see theorem \ref{thm:extremal}). We also conjecture that the numbers in that family are the only ones reaching the bound (see conjecture \ref{cjt:extremal}).
Document type :
Other publications
Complete list of metadata

Cited literature [9 references]

https://hal.archives-ouvertes.fr/hal-00642292
Contributor : Jean-Pierre Flori Connect in order to contact the contributor
Submitted on : Thursday, November 17, 2011 - 5:19:41 PM
Last modification on : Monday, January 24, 2022 - 11:43:20 AM
Long-term archiving on: : Friday, November 16, 2012 - 11:21:44 AM

### File

170.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-00642292, version 1

### Citation

Jean-Pierre Flori, Hugues Randriambololona, Gérard Cohen, Sihem Mesnager. On a conjecture about binary strings distribution. 2010. ⟨hal-00642292⟩

Record views