Abstract
The r th-order nonlinearity of a Boolean function plays a vital role in analyzing the security of stream and block ciphers. In this paper, we present a lower bound on the \(\left (\frac{m}{2}\right )\)th-order nonlinearity of a bent Boolean function class of the form \(g(x)=T{r_{1}^{n}}\left (\alpha _{1}x^{d_{1}}+\alpha _{2}x^{d_{2}}\right )\), where \(\alpha _{1}, \alpha _{2}\in \mathbb{F}_{2^{n}}, n=2m\) and d1, d2 are Niho exponents, which was constructed by Dobbertin et al. (Construction of bent functions via Niho power functions, J. Comb. Theory. Ser. A, 113, 779–798 in 8). We compared the computed lower bound for the second-order nonlinearity with the lower bound obtained by Gode and Gangopadhyay (IACR Crypt. ePrint Archieve 2009, 502, 15) for the class of Boolean functions \(g_{\mu }(x)=T{r_{1}^{n}}(\mu x^{2^{i}+2^{j}+1}), i>j\), for n > 2i(n≠i + j and n≠ 2i − j) when n = 8 and i = 3. We also compared the computed lower bound for the third-order nonlinearity with the lower bound obtained by Singh (Int. J. Eng. Math. 2014, 1–7, 22) for the class of Boolean functions \(f_{\lambda }(x)=T{r_{1}^{n}}\left (\lambda x^{d}\right )\), for all \(x\in \mathbb{F}_{{2}^{n}}\), \(\lambda \in \mathbb{F}_{2^{n}}^{*}\), where d = 2i + 2j + 2k + 1, where i, j and k are integers such that i > j > k ≥ 1 and n > 2i when n = 12 and i = 5, and Gode and Gangopadhyay (Cryptogr. Commun. 2, 69–83, 15) for the class \(f_{\mu }(x)=T{r_{1}^{n}}\left (\mu x^{k}\right )\), where k = 22d − 2d + 1 with 1 ≤ d < n, n > 10 and \(\mu \in \mathbb{F}_{{2}^{n}}\), for d= 3 and for all \(x\in \mathbb{F}_{2^{n}}\) when n = 12. It is then shown that our computed lower bound is better than the lower bounds obtained by Gode et al. and Singh for other classes of Boolean functions for the provided values of n and i.
Similar content being viewed by others
References
Canteaut, A., Charpin, P., Kyureghyan, G.M.: A new class of monomial bent functions. Finit. Fields Appl. 14, 221–241 (2008)
Carlet, C.: Vectorial boolean functions for cryptography. In: Boolean Models and Methods in Mathematics, Computer Science, and Engineering, vol. 134, pp 398–469 (2010)
Carlet, C.: Recursive lower bounds on the nonlinearity profile of Boolean functions and their applications. IEEE Trans. Inf. Theory 54, 1262–1272 (2008)
Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Boolean Models and Methods in Mathematics, Computer Science, and Engineering, vol. 2, pp 257–397 (2010)
Carlet, C., Mesnager, S.: Improving the upper bounds on the covering radii of binary Reed–Muller codes. IEEE Trans. Inf. Theory 53, 162–173 (2006)
Carlet, C.: Boolean functions for cryptography and coding theory, Monograph in Cambridge University Press, pp. 1–562 (2021)
Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes, p 541. Elsevier, North Holland (1997)
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)
Dumer, I., Kabatiansky, G., Tavernier, C.: List decoding of Reed-Muller codes up to the Johnson bound with almost linear complexity. IEEE International Symposium on Information Theory–Proceedings, pp. 138–142 (2006)
Fourquet, R., Tavernier, C.: An improved list decoding algorithm for the second order reed–muller codes and its applications. Des Codes Crypt 49, 323–340 (2008)
Gangopadhyay, S., Sarkar, S., Telang, R.: On the lower bounds of the second order nonlinearities of some Boolean functions. Inform. Sci. 180, 266–273 (2010)
Gao, Q., Tang, D.: A lower bound on the second-order nonlinearity of the generalized maiorana-mcfarland boolean functions. IEICE Trans. Fundam. Electron. Commun. Comput Sci. 101, 2397–2401 (2018)
Garg, M., Gangopadhyay, S.: A lower bound of the second–order nonlinearities of boolean bent functions. Fundam. Informaticae 111, 413–422 (2011)
Garg, M., Khalyavin, A.: Higher-order nonlinearity of Kasami functions. Int. J. Comput. Math. 89, 1311–1318 (2012)
Gode, R., Gangopadhyay, S.: On second-order nonlinearities of cubic monomial Boolean functions. IACR Crypt. ePrint Archieve 2009, 502 (2009)
Gode, R., Gangopadhyay, S.: On higher-order nonlinearities of monomial partial spreads type boolean functions. J. Comb. Inf. Syst. Sci. 35, 341–360 (2010)
Gode, R., Gangopadhyay, S.: Third-order nonlinearities of a subclass of Kasami functions. Cryptogr. Commun. 2, 69–83 (2010)
Iwata, T., Kurosawa, K.: Probabilistic higher order differential attack and higher order bent functions. In: International Conference on the Theory and Application of Cryptology and Information Security, Springer, pp 62–74 (1999)
Kabatiansky, G., Tavernier, C.: List decoding of second order reed-muller codes, Proc. 8Th Intern. Simp. Comm. Theory and Applications, Ambleside, UK (2005)
MacWilliams, F.J., Sloane, N.J.A.: The theory of Error-Correcting codes, vol. 16. Elsevier (1977)
Rothaus, O.S.: On ben functions. J. Comb. Theory. Series A 20, 300–305 (1976)
Singh, B.K.: On third-order nonlinearity of biquadratic monomial boolean functions. Int. J. Eng. Math. 2014, 1–7 (2014)
Sun, G., Wu, C.: The lower bounds on the second order nonlinearity of three classes of Boolean functions with high nonlinearity. Inform. Sci. 179, 267–278 (2009)
Sun, G., Wu, C.: The lower bound on the second-order nonlinearity of a class of Boolean functions with high nonlinearity. Appl. Algebra Eng. Commun. Comput. 22, 37–45 (2011)
Tang, D., Yan, H., Zhou, Z., Zhang, X.: A new lower bound on the second-order nonlinearity of a class of monomial bent functions. Cryptogr. Commun. 12, 77–83 (2020)
Wang, Q., Johansson, T.: A note on fast algebraic attacks and higher order nonlinearities. In: International Conference on Information Security and Cryptology, pp 404–414. Springer (2010)
Acknowledgements
Kezia Saini would like to thank the Council of Scientific and Industrial Research for providing the financial support.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Saini, K., Garg, M. On the higher-order nonlinearity of a Boolean bent function class (Constructed via Niho power functions). Cryptogr. Commun. 14, 1055–1066 (2022). https://doi.org/10.1007/s12095-022-00574-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-022-00574-7