Advertisement

Weightwise perfectly balanced functions with high weightwise nonlinearity profile

  • Jian Liu
  • Sihem Mesnager
Article

Abstract

Boolean functions satisfying good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher (Méaux et al.: in Lecture Notes in Computer Science, vol. 9665, pp. 311–343, Springer, Berlin, 2016). In this paper, we propose a large class of weightwise perfectly balanced (WPB) functions, which is 2-rotation symmetric. This new class of WPB functions is not extended affinely equivalent to the known constructions. We also discuss the weightwise nonlinearity profile of these functions, and present general lower bounds on k-weightwise nonlinearity, where k is a power of 2. Moreover, we exhibit a subclass of the family. By a recursive lower bound, we show that these subclass of WPB functions have very high weightwise nonlinearity profile.

Keywords

FLIP cipher Boolean function Weightwise perfectly balance Weightwise nonlinearity 

Mathematics Subject Classification

11T71 94A60 06E30 

Notes

Acknowledgements

The authors thank the anonymous reviewers for their valuable comments which have highly improved the manuscript.

References

  1. 1.
    Carlet C.: Boolean functions for cryptography and error correcting codes. In: Crama Y., Hammer P. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257–397. Cambridge University Press, London (2010).CrossRefGoogle Scholar
  2. 2.
    Carlet C.: Vectorial Boolean functions for cryptography. In: Crama Y., Hammer P. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 398–469. Cambridge University Press, London (2010).CrossRefGoogle Scholar
  3. 3.
    Carlet C., Gao G., Liu W.: A secondary construction and a transformation on rotation symmetric functions, and their action on bent and semi-bent functions. J. Comb. Theory A 127, 161–175 (2014).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 Trans. Symmetric Cryptol. 2017(3), 192–227 (2017).Google Scholar
  5. 5.
    Daemen J.: Cipher and hash function design strategies based on linear and differential cryptanalysis, PhD thesis, Catholic University of Louvain (1995).Google Scholar
  6. 6.
    Duval S., Lallemand V., Rotella Y.: Cryptanalysis of the FLIP family of stream ciphers. In: Advances in Cryptology—CRYPTO 2016, Lecture Notes in Computer Science, vol. 9814, pp. 457–475. Springer, Berlin (2016).CrossRefGoogle Scholar
  7. 7.
    Filmus Y.: Friedgut-Kalai-Naor theorem for slices of the Boolean cube. Chicago J. Theor. Comput. Sci. 14, 1–17 (2016).MathSciNetCrossRefGoogle Scholar
  8. 8.
    Filmus Y.: An orthogonal basis for functions over a slice of the Boolean hypercube. Electron. J. Comb. 23(1), 1–23 (2016).MathSciNetzbMATHGoogle Scholar
  9. 9.
    Filmus Y., Mossel E.: Harmonicity and invariance on slices of the Boolean cube. In: 31st Conference on Computational Complexity, CCC 2016, pp. 1–16 (2016).Google Scholar
  10. 10.
    Filmus Y., Kindler G., Mossel E., Wimmer K.: Invariance principle on the slice. In: 31st Conference on Computational Complexity, CCC 2016, pp. 1–15 (2016).MathSciNetCrossRefGoogle Scholar
  11. 11.
    Hell M., Johansson T., Maximov A., Meier W.: A stream cipher proposal: Grain-128. In: 2006 IEEE International Symposium on Information Theory, ISIT, pp. 1614–1618 (2006).Google Scholar
  12. 12.
    Joux A., Delaunay P.: Galois LFSR, embedded devices and side channel weaknesses. In: Progress in Cryptology—INDOCRYPT 2006, Lecture Notes in Computer Science, vol. 4329, pp. 436–451. Springer, Berlin (2006).CrossRefGoogle Scholar
  13. 13.
    Kavut S.: Results on rotation-symmetric S-boxes. Inf. Sci. 201, 93–113 (2012).MathSciNetCrossRefGoogle Scholar
  14. 14.
    Kavut S., Yücel M.D.: 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class. Inf. Comput. 208(4), 341–350 (2010).MathSciNetCrossRefGoogle Scholar
  15. 15.
    MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Company, Amsterdam (1977).zbMATHGoogle Scholar
  16. 16.
    Méaux P., Journault A., Standaert F.-X., Carlet C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts, In: Advances in Cryptology—EUROCRYPT 2016, Lecture Notes in Computer Science, vol. 9665, pp. 311–343. Springer, Berlin (2016).CrossRefGoogle Scholar
  17. 17.
    Mesnager S., Zhou Z., Ding C.: On the nonlinearity of Boolean functions with restricted input. Cryptogr. Commun. 1–14 (2018).Google Scholar
  18. 18.
    Su S., Tang X.: Systematic constructions of rotation symmetric bent functions, 2-rotation symmetric bent functions, and bent idempotent functions. IEEE Trans. Inf. Theory 63(7), 4658–4667 (2017).MathSciNetCrossRefGoogle Scholar

Copyright information

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

Authors and Affiliations

  1. 1.School of Computer SoftwareTianjin UniversityTianjinPeople’s Republic of China
  2. 2.CNRS, UMR 7539 LAGAParisFrance
  3. 3.Department of MathematicsUniversity of Paris VIII, University of Paris XIII, CNRS, UMR 7539 LAGAParisFrance
  4. 4.Telecom ParisTechParisFrance

Personalised recommendations