Abstract
When analyzing the security of block ciphers and stream ciphers, the \(r-th\) order nonlinearity of a Boolean function is crucial. They also have a prominent place in coding theory because the \(r-th\) order nonlinearity of Boolean functions is connected to the covering radius of \(\mathcal{R}\mathcal{M}(r,m)\), i.e., Reed-Muller code. In this study, we determine the lower bound for the higher-order nonlinearity of the two classes of Boolean functions listed below.
-
1.
\(f_{\alpha }(u)=tr_1^m(\alpha u^d)\), where d is the Niho exponent constructed by Dobbertin et al. (J. Comb. Theory Ser. A 113:779–798, 2006).
-
2.
\(g_{\alpha }(u)=tr_1^m(\alpha u^d)\), where \(d=2^p-2\). For all \(u\in \mathbb {F}_{2^m},~\alpha \in \mathbb {F}_{2^m}^*\) and \(m=2p\).
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.: On the nonlinearity profile of the Dillon function, p. 577. IACR Cryptology ePrint Archive (2009)
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, pp. 1–562. Monograph in Cambridge University Press (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, J., Kan, H., Li, Y. and Wang, Q.: The Covering Radius of the Third-Order Reed-Muller Code RM(3,7) is 20. IEEE Trans. Inf. Theory. https://doi.org/10.1109/TIT.2023.3242966
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)
Garg, M.: Higher order-nonlinearities of two classes of Boolean functions. Int. J. Comput. Sci. Inf. Technol. 6(5), 4251–4256 (2015)
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, pp. 62–74. Springer (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. Ser. 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)
Wang, Q., Stănică, P.: New bounds on the covering radius of the second order Reed-Muller code of length 128. Cryptogr. Commun. 11, 269–277 (2019)
Author information
Authors and Affiliations
Contributions
Both authors made substantial contributions to the conception. Sampada Tiwari prepared the original draft of the Manuscript. Both authors reviewed the manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Tiwari, S., Sharma, D. On higher order nonlinearities of Boolean functions. Cryptogr. Commun. 15, 821–830 (2023). https://doi.org/10.1007/s12095-023-00643-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12095-023-00643-5