{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T18:02:24Z","timestamp":1708538544643},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T00:00:00Z","timestamp":1685404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T00:00:00Z","timestamp":1685404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s12095-023-00643-5","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T09:04:32Z","timestamp":1685437472000},"page":"821-830","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On higher order nonlinearities of Boolean functions"],"prefix":"10.1007","volume":"15","author":[{"given":"Sampada","family":"Tiwari","sequence":"first","affiliation":[]},{"given":"Deepmala","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"643_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ffa.2007.02.004","volume":"14","author":"A Canteaut","year":"2008","unstructured":"Canteaut, A., Charpin, P., Kyureghyan, G.M.: A new class of monomial bent functions. Finit. Fields Appl. 14, 221\u2013241 (2008)","journal-title":"Finit. Fields Appl."},{"key":"643_CR2","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Vectorial boolean functions for cryptography. In: Boolean Models and Methods in Mathematics, Computer Science, and Engineering, vol. 134, pp. 398\u2013469 (2010)","DOI":"10.1017\/CBO9780511780448.012"},{"key":"643_CR3","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1109\/TIT.2007.915704","volume":"54","author":"C Carlet","year":"2008","unstructured":"Carlet, C.: Recursive lower bounds on the nonlinearity profile of Boolean functions and their applications. IEEE Trans. Inf. Theory 54, 1262\u20131272 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"643_CR4","unstructured":"Carlet, C.: On the nonlinearity profile of the Dillon function, p. 577. IACR Cryptology ePrint Archive (2009)"},{"key":"643_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013397 (2010)","DOI":"10.1017\/CBO9780511780448.011"},{"key":"643_CR6","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/TIT.2006.887494","volume":"53","author":"C Carlet","year":"2006","unstructured":"Carlet, C., Mesnager, S.: Improving the upper bounds on the covering radii of binary Reed-Muller codes. IEEE Trans. Inf. Theory 53, 162\u2013173 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"643_CR7","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean functions for cryptography and coding theory, pp. 1\u2013562. Monograph in Cambridge University Press (2021)","DOI":"10.1017\/9781108606806"},{"key":"643_CR8","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes, p. 541. Elsevier, North Holland (1997)"},{"key":"643_CR9","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/j.jcta.2005.07.009","volume":"113","author":"H Dobbertin","year":"2006","unstructured":"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\u2013798 (2006)","journal-title":"J. Comb. Theory Ser. A"},{"key":"643_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013142. (2006)","DOI":"10.1109\/ISIT.2006.261690"},{"key":"643_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10623-008-9184-8","volume":"49","author":"R Fourquet","year":"2008","unstructured":"Fourquet, R., Tavernier, C.: An improved list decoding algorithm for the second order reed-muller codes and its applications. Des Codes Crypt. 49, 323\u2013340 (2008)","journal-title":"Des Codes Crypt."},{"key":"643_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.ins.2009.09.006","volume":"180","author":"S Gangopadhyay","year":"2010","unstructured":"Gangopadhyay, S., Sarkar, S., Telang, R.: On the lower bounds of the second order nonlinearities of some Boolean functions. Inform. Sci. 180, 266\u2013273 (2010)","journal-title":"Inform. Sci."},{"key":"643_CR13","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1109\/TIT.2023.3242966"},{"key":"643_CR14","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1587\/transfun.E101.A.2397"},{"key":"643_CR15","doi-asserted-by":"publisher","first-page":"413","DOI":"10.3233\/FI-2011-570","volume":"111","author":"M Garg","year":"2011","unstructured":"Garg, M., Gangopadhyay, S.: A lower bound of the second-order nonlinearities of boolean bent functions. Fundam. Informaticae 111, 413\u2013422 (2011)","journal-title":"Fundam. Informaticae"},{"key":"643_CR16","doi-asserted-by":"publisher","first-page":"1311","DOI":"10.1080\/00207160.2012.687725","volume":"89","author":"M Garg","year":"2012","unstructured":"Garg, M., Khalyavin, A.: Higher-order nonlinearity of Kasami functions. Int. J. Comput. Math. 89, 1311\u20131318 (2012)","journal-title":"Int. J. Comput. Math."},{"issue":"5","key":"643_CR17","first-page":"4251","volume":"6","author":"M Garg","year":"2015","unstructured":"Garg, M.: Higher order-nonlinearities of two classes of Boolean functions. Int. J. Comput. Sci. Inf. Technol. 6(5), 4251\u20134256 (2015)","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"643_CR18","first-page":"341","volume":"35","author":"R Gode","year":"2010","unstructured":"Gode, R., Gangopadhyay, S.: On higher-order nonlinearities of monomial partial spreads type boolean functions. J. Comb. Inf. Syst. Sci. 35, 341\u2013360 (2010)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"643_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12095-009-0017-z","volume":"2","author":"R Gode","year":"2010","unstructured":"Gode, R., Gangopadhyay, S.: Third-order nonlinearities of a subclass of Kasami functions. Cryptogr. Commun. 2, 69\u201383 (2010)","journal-title":"Cryptogr. Commun."},{"key":"643_CR20","doi-asserted-by":"crossref","unstructured":"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\u201374. Springer (1999)","DOI":"10.1007\/978-3-540-48000-6_7"},{"key":"643_CR21","unstructured":"Kabatiansky, G., Tavernier, C.: List decoding of second order reed-muller codes. Proc. 8Th Intern. Simp. Comm. Theory and Applications, Ambleside, UK (2005)"},{"key":"643_CR22","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of Error-Correcting codes, vol. 16. Elsevier (1977)"},{"key":"643_CR23","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"OS Rothaus","year":"1976","unstructured":"Rothaus, O.S.: On ben functions. J. Comb. Theory. Ser. A 20, 300\u2013305 (1976)","journal-title":"J. Comb. Theory. Ser. A"},{"key":"643_CR24","first-page":"1","volume":"2014","author":"BK Singh","year":"2014","unstructured":"Singh, B.K.: On third-order nonlinearity of biquadratic monomial boolean functions. Int. J. Eng. Math. 2014, 1\u20137 (2014)","journal-title":"Int. J. Eng. Math."},{"key":"643_CR25","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s12095-018-0289-2","volume":"11","author":"Q Wang","year":"2019","unstructured":"Wang, Q., St\u0103nic\u0103, P.: New bounds on the covering radius of the second order Reed-Muller code of length 128. Cryptogr. Commun. 11, 269\u2013277 (2019)","journal-title":"Cryptogr. Commun."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00643-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00643-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00643-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T09:05:03Z","timestamp":1686733503000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00643-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,30]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["643"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00643-5","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,30]]},"assertion":[{"value":"28 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}