Skip to main content
Log in

A class of hyper-bent functions and Kloosterman sums

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

This paper is devoted to the characterization of hyper-bent functions. Several classes of hyper-bent functions have been studied, such as Charpin and Gong’s family \(\sum \limits _{r\in R}\text {Tr}_{1}^{n} (a_{r}x^{r(2^{m}-1)})\) and Mesnager’s family \(\sum \limits _{r\in R}\text {Tr}_{1}^{n}(a_{r}x^{r(2^{m}-1)}) +\text {Tr}_{1}^{2}(bx^{\frac {2^{n}-1}{3}})\) . In this paper, we generalize these results by considering the following class of Boolean functions over \(\mathbb {F}_{2^{n}}\):

$$\sum\limits_{r\in R}\sum\limits_{i=0}^{2}T{r^{n}_{1}}(a_{r,i} x^{r(2^{m}-1)+\frac{2^{n}-1}{3}i}) +T{r^{2}_{1}}(bx^{\frac{2^{n}-1}{3}}), $$

where \(n=2m\), m is odd, \(b\in \mathbb {F}_{4}\), and \(a_{r,i}\in \mathbb {F}_{2^{n}}\). With the restriction of \(a_{r,i}\in \mathbb {F}_{2^{m}}\), we present a characterization of hyper-bentness of these functions in terms of crucial exponential sums. For some special cases, we provide explicit characterizations for some hyper-bent functions in terms of Kloosterman sums and cubic sums. Finally, we explain how our results on binomial, trinomial and quadrinomial hyper-bent functions can be generalized to the general case where the coefficients \(a_{r,i}\) belong to the whole field \(\mathbb {F}_{2^{n}}\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. Later, Flori and Mesnager [11] have shown that the condition of maximality is not necessary.

References

  1. Canteaut, A., Charpin, P., Kyureghyan, G.: A new class of monomial bent functions. Finite Fields Appl 14(1), 221–241 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Carlet, C.: Boolean Functions for Cryptography and Error Correcting Codes. In: Crama, Y., Hammer, P (eds.) Chapter of the monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp 257–397. Cambridge University Press, Cambridge (2010)

    Chapter  Google Scholar 

  3. Carlet, C., Gaborit, P.: Hyper-bent functions and cyclic codes. J. Comb. Theory Ser. A 113(3), 466–482 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Carlitz, L.: Explicit evaluation of certain exponential sums. Math. Scand. 44, 5–16 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Charpin, P., Gong, G.: Hyperbent functions, Kloosterman sums and Dickson polynomials. IEEE Trans. Inf. Theory 54(9), 4230–4238 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Charpin, P., Helleseth, T., Zinoviev, V.: The divisibility modulo 24 of Kloosterman sums of GF(2m), m odd. J. Comb. Theory, Series A 114, 322–338 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Charpin, P., Kyureghyan, G.: Cubic monomial bent functions: a subclass of M. SIAM J. Discret. Math. 22(2), 650–665 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dillon, J.F.: Elementary Hadamard difference sets. PhD Dissertation, University of Maryland College Park (1974)

  9. Dillon, J.F., Dobbertin, H.: New cyclic difference sets with Singer parameters. Finite Fields Appl. 10(3), 342–389 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dobbertin, H., Leander, G., Canteaut, A., Carlet, C., Felke, P., Gaborit, P.: Construction of bent functions via Niho power functions. J. Comb. Theory Ser. A 113, 779–798 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Flori, J.P., Mesnager, S.: An efficient characterization of a family of hyper-bent functions with multiple trace terms. J. Math. Cryptol. 7(1), 43–68 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. Flori, J.P., Mesnager, S.: Dickson polynomials, hyperelliptic curves and hyper-bent functions. In: Proceedings of the 7th International Conference Sequences and Their Applications, SETA 2012, Waterloo. Lecture Notes in Computer Science, vol. 7780, pp 40–52. Springer, Berlin (2012)

    Google Scholar 

  13. Flori, J.P., Mesnager, S., Cohen, G.: The Value 4 of Binary Kloosterman Sums. In: Proceedings of the Thirteenth International Conference on Cryptography and Coding, Oxford, United Kingdom, IMACC 2011. Lecture Notes in Computer Science, vol. 7089, pp 61–78. Springer, Berlin (2011)

    Google Scholar 

  14. Gold, R.: Maximal recursive sequences with 3-valued recursive crosscorrelation functions. IEEE Trans. Inf. Theory 14(1), 154–156 (1968)

    Article  MATH  Google Scholar 

  15. Gong, G., Golomb, S.: Transform domain analysis of DES. IEEE Trans. Inf. Theory 45(6), 2065–2073 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lachaud, G., Wolfmann, J.: The weights of the orthogonals of the extended quadratic binary Goppa codes. IEEE Trans. Inf. Theory 36(3), 686–692 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  17. Leander, G.: Monomial bent functions. Proceedings of WCC 2006, pp. 462–470, (2005). And IEEE Trans. Inf. Theory, 52(2), 738–743 (2006)

  18. Leander, G., Kholosha, A.: Bent functions with 2r Niho exponents. IEEE Trans. Inf. Theory 52, 5529–5532 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  19. Li, N., Helleseth, T., Tang, X., Kholosha, A.: Several new classes of bent functions from Dillon exponents. IEEE Trans. Inf. Theory 59(3), 1818–1831 (2013)

    Article  MathSciNet  Google Scholar 

  20. Lisoněk, P.: An efficient characterization of a family of hyperbent functions. IEEE Trans. Inf. Theory 57(9), 6010–6014 (2011)

    Article  MathSciNet  Google Scholar 

  21. Lisoněk, P.: On the connection between Kloosterman sums and elliptic curves. In: Golomb et al. (ed.) Proceedings of the 5th International Conference on Sequences and Their Applications (SETA 2008), Lecture Notes in Computer Science, vol. 5203, pp 182–187. Springer (2008)

  22. Mesnager, S.: A new class of bent and Hyper-Bent Boolean functions in polynomial forms. Des. Codes Cryptogr. 59(1-3), 265–279 (2011). see also proceedings of WCC 2009

    Article  MathSciNet  MATH  Google Scholar 

  23. Mesnager, S.: A new family of hyper-bent Boolean functions in polynomial form. In: Mesnager, S. (ed.) Proceedings of Twelfth International Conference on Cryptography and Coding. Cirencester, IMACC 2009, LNCS 5921, pp 402–417. Springer, Heidelberg (2009)

  24. Mesnager, S.: Hyper-bent Boolean functions with multiple trace terms. In: Proceedings of International Workshop on the Arithmetic of Finite Fields (WAIFI 2010). Lecture Notes in Computer Science, vol. 6087, pp 97–113 (2010)

  25. Mesnager, S.: Bent and hyper-bent functions in polynomial form and their link with some exponential sums and Dickson polynomials. IEEE Trans. Inf. Theory 57(9), 5996–6009 (2011)

    Article  MathSciNet  Google Scholar 

  26. Mesnager, S.: A new family of hyper-bent Boolean functions in polynomial form. In: Proceedings of Twelfth International Conference on Cryptography and Coding (IMACC 2009). Lecture Notes in Computer Science, vol. 5921, pp 402–417. Springer, Heidelberg (2009)

    Google Scholar 

  27. Mesnager, S., Flori, J.P.: Hyper-bent functions via Dillon-like exponents. IEEE Trans. Inf. Theory 59(5), 3215–3232 (2013)

    Article  Google Scholar 

  28. Lidl, R., Mullen, G.L., Turnwald, G.: Dickson Polynomials (1993)

  29. Rothaus, O.S.: On bent functions. J. Comb. Theory Ser. A 20, 300–305 (1976)

    Article  MATH  Google Scholar 

  30. Schoof, R.: Counting Points on Elliptic Curves over Finite Fields. J. Theor. Nombres Bordeaux 7, 219–254 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  31. Tang, C., Li, N., Qi, Y., Zhou, Z., Helleseth, T.: Linear codes with two or three weights from weakly regular bent functions. IEEE Trans. Inf. Theory 62(3), 1166-1176 (2016)

  32. Wang, B., Tang, C., Qi, Y., Yang, Y.: A generalization of the class of hyper-bent Boolean functions in binomial forms. Cryptology ePrint Archive, Report 2011/698 (2011). http://eprint.iacr.org/

  33. Wang, B., Tang, C., Qi, Y., Yang, Y., Xu, M.: A new class of hyper-bent Boolean functions in binomial forms. CoRR, abs/1112, 0062 (2011)

  34. Wang, B., Tang, C., Qi, Y., Yang, Y., Xu, M.: A new class of hyper-bent Boolean functions in binomial forms. CoRR, arXiv:1112.0062

  35. Youssef, A.M., Gong, G.: Hyper-bent functions. In: Proceedings of EUROCRYPT 2001. Lecture Notes in Computer Science, vol. 2045, pp 406–419. Springer, Berlin (2001)

    Google Scholar 

  36. Yu, N.Y., Gong, G.: Construction of quadratic bent functions in polynomial forms. IEEE Trans. Inf. Theory 7(52), 3291–3299 (2006)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgment

We would like to thank the anonymous reviewers and Prof. Claude Carlet for their helpful comments and suggestions.

This work was supported by the National Natural Science Foundation of China (Grant No. 11401480, No. 11531002, No. 11501154 ). C. Tang also acknowledges support from 14E013 and CXTD2014-4 of China West Normal University.

Y. Qi aslo acknowledges support from Zhejiang provincial Natural Science Foundation of China (Grant No. LQ17A010008).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chunming Tang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tang, C., Qi, Y. A class of hyper-bent functions and Kloosterman sums. Cryptogr. Commun. 9, 647–664 (2017). https://doi.org/10.1007/s12095-016-0207-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-016-0207-4

Keywords

Mathematics Subject Classification (2010)

Navigation