Advertisement

Cryptography and Communications

, Volume 11, Issue 1, pp 63–76 | Cite as

On the nonlinearity of Boolean functions with restricted input

  • Sihem MesnagerEmail author
  • Zhengchun Zhou
  • Cunsheng Ding
Article
Part of the following topical collections:
  1. Special Issue on Boolean Functions and Their Applications

Abstract

Very recently, Carlet, Méaux and Rotella have studied the main cryptographic features of Boolean functions when, for a given number n of variables, the input to these functions is restricted to some subset E of \(\mathbb {F}_{2}^{n}\). Their study includes the particular case when E equals the set of vectors of fixed Hamming weight, which is important in the robustness of the Boolean function involved in the FLIP stream cipher. In this paper we focus on the nonlinearity of Boolean functions with restricted input and present new results related to the analysis of this nonlinearity improving the upper bound given by Carlet et al.

Keywords

Boolean functions Nonlinearity Walsh Hadamard transform FLIP cipher 

Mathematics Subject Classification (2010)

11T71 11T06 

References

  1. 1.
    Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P. L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp 257–397. Cambridge University Press, Cambridge (2010)Google Scholar
  2. 2.
    Carlet, C., Mesnager, S.: Improving the upper bounds on the covering radii of binary Reed-Muller codes. IEEE Trans. Inf. Theory 53(1), 162–173 (2007)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Carlet, C., Mesnager, S.: Four decades of research on bent functions. Des. Codes Crypt. 78(1), 5–50 (2016)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Carlet, C., Méaux, P., Rotella, Y.: Boolean functions with restricted input and their robustness; application to the flip cipher. IACR Transactions on Symmetric Cryptology (3), 192–227.  https://doi.org/10.13154/tosc.v2017.i3.192-227 (2017)
  5. 5.
    Dillon, J.: Elementary Hadamard difference sets. PhD Thesis, University of Maryland (1974)Google Scholar
  6. 6.
    Méaux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: EUROCRYPT 2016, pp. 311–343 (2016)Google Scholar
  7. 7.
    Mesnager, S.: Binary Bent Functions: Fundamentals and Results. Springer, Switzerland (2016)CrossRefGoogle Scholar
  8. 8.
    Rothaus, O.S.: On “bent” functions. Journal of Combinatorial Theory, Series A 20, 300–305 (1976)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Wang, Q., Johansson, T.: A note on fast algebraic attacks and higher order nonlinearities. In: International Conference on Information Security and Cryptology, Inscrypt 2010, pp. 404–414 (2010)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of Paris VIIISaint-DenisFrance
  2. 2.LAGA, UMR 7539, CNRSUniversity of Paris XIIIVilletaneuseFrance
  3. 3.Telecom ParisTechParisFrance
  4. 4.Department of MathematicsSothwest Jiaotong UniversityChengduChina
  5. 5.Department of Computer Science and EngineeringThe Hong Kong University of Science and TechnologyHong KongChina

Personalised recommendations