Advertisement

On a Conjecture about Binary Strings Distribution

  • Jean-Pierre Flori
  • Hugues Randriam
  • Gérard Cohen
  • Sihem Mesnager
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6338)

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. Very recently, an infinite class of Boolean functions has been proposed by Tu and Deng having many good cryptographic properties under the assumption that the following combinatorial conjecture about binary strings is true:

Conjecture 0.1. Let S t,k be the following set:

$$ {S_{t,k}}= \left\{{(a,b)} {\in} \left( {{\mathbb Z} / {(2^k-1)} {\mathbb Z}} \right)^2 | a + b = t ~{\rm and }~ w(a) + w(b) < k \right\}. $$

Then:

$$ |{S_{t,k}}| \leq 2^{k-1}. $$

The main contribution of the present paper is the reformulation of the problem in terms of carries which gives more insight on it than simple counting arguments. Successful applications of our tools include explicit formulas of \(\left|{S_{t,k}}\right|\) for numbers whose binary expansion is made of one block, a proof that the conjecture is asymptotically true and a proof that a family of numbers (whose binary expansion has a high number of 1s and isolated 0s) reaches the bound of the conjecture. We also conjecture that the numbers in that family are the only ones reaching the bound.

Keywords

Boolean Function Binary String Stream Cipher Linear Feedback Shift Register Algebraic Degree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Courtois, N., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345–359. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Courtois, N.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Carlet, C., Feng, K.: An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 425–440. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    Tu, Z., Deng, Y.: A conjecture on binary string and its applications on constructing boolean functions of optimal algebraic immunity. Cryptology ePrint Archive, Report 2009/272 (2009), http://eprint.iacr.org/
  5. 5.
    Dillon, J.: Elementary Hadamard Difference Sets. PhD thesis, University of Maryland (1974)Google Scholar
  6. 6.
    Carlet, C.: On a weakness of the Tu-Deng function and its repair. Cryptology ePrint Archive, Report 2009/606 (2009), http://eprint.iacr.org/
  7. 7.
    Flori, J.P., Randriambololona, H., Cohen, G., Mesnager, S.: On a conjecture about binary strings distribution. Cryptology ePrint Archive, Report 2010/170 (2010), http://eprint.iacr.org/
  8. 8.
    Monagan, M.B., Geddes, K.O., Heal, K.M., Labahn, G., Vorkoetter, S.M., McCarron, J., DeMarco, P.: Maple 10 Programming Guide. Maplesoft, Waterloo ON, Canada (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jean-Pierre Flori
    • 1
  • Hugues Randriam
    • 1
  • Gérard Cohen
    • 1
  • Sihem Mesnager
    • 2
  1. 1.Institut TélécomTélécom ParisTech, CNRS LTCIParis Cedex 13France
  2. 2.LAGA (Laboratoire Analyse, Géometrie et Applications), UMR 7539, CNRS, Department of MathematicsUniversity of Paris XIII and University of Paris VIIISaint-Denis CedexFrance

Personalised recommendations