{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:28Z","timestamp":1740148948462,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["18-11-00136"],"award-info":[{"award-number":["18-11-00136"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s12095-024-00716-z","type":"journal-article","created":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T08:02:12Z","timestamp":1714118532000},"page":"975-996","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Equitable [[2,\u00a010],\u00a0[6,\u00a06]]-partitions of the 12-cube"],"prefix":"10.1007","volume":"16","author":[{"given":"Denis S.","family":"Krotov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,26]]},"reference":[{"key":"716_CR1","doi-asserted-by":"publisher","unstructured":"Camion, P.,\u00a0Carlet, C.,\u00a0Charpin, P., Sendrier, N.: On correlation-immune functions. In: Joan Feigenbaum, editor. Advances in Cryptology \u2014 CRYPTO \u201991. volume 576 of Lect. Notes Comput. Sci., pages 86\u2013100. Springer, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_6","DOI":"10.1007\/3-540-46766-1_6"},{"key":"716_CR2","unstructured":"Fon-Der-Flaass, D.G.: A bound on correlation immunity. Sib. \u00c8lektron. Mat. Izv., 4, 133\u2013135 (2007). http:\/\/mi.mathnet.ru\/eng\/semr149"},{"key":"716_CR3","doi-asserted-by":"publisher","unstructured":"Fon-Der-Flaass, D.G.: Perfect $$2$$-colorings of a hypercube. Sib. Math. J. 48(4), 740\u2013745 (2007). translated from Sib. Mat. Zh. 48(4), 923-930 (2007) https:\/\/doi.org\/10.1007\/s11202-007-0075-4","DOI":"10.1007\/s11202-007-0075-4"},{"key":"716_CR4","unstructured":"Fon-Der-Flaass, D.G.: Perfect colorings of the $$12$$-cube that attain the bound on correlation immunity. Sib. \u00c8lektron. Mat. Izv. 4, 292\u2013295 (2007). In Russian. English translation: arXiv:1403.8091"},{"key":"716_CR5","doi-asserted-by":"publisher","unstructured":"Friedman, J.: On the bit extraction problem. In: Foundations of Computer Science, IEEE Annual Symposium on, pages 314\u2013319, Los Alamitos, CA, USA. IEEE Computer Society (1992). https:\/\/doi.org\/10.1109\/SFCS.1992.267760","DOI":"10.1109\/SFCS.1992.267760"},{"key":"716_CR6","doi-asserted-by":"publisher","unstructured":"Kaski, P., \u00d6sterg\u00e5rd, P.R.J.: Classification Algorithms for Codes and Designs, volume\u00a015 of Algorithms Comput. Math. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/3-540-28991-7","DOI":"10.1007\/3-540-28991-7"},{"key":"716_CR7","unstructured":"Kaski, P., Pottonen, O.: libexact user\u2019s guide, version 1.0. Technical Report 2008-1, Helsinki Institute for Information Technology HIIT (2008)"},{"issue":"3","key":"716_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.3103\/S0027132210030101","volume":"65","author":"AV Khalyavin","year":"2010","unstructured":"Khalyavin, A.V.: Estimates of the capacity of orthogonal arrays of large strength. Mosc. Univ. Math. Bull. 65(3), 130\u2013131 (2010). https:\/\/doi.org\/10.3103\/S0027132210030101","journal-title":"Mosc. Univ. Math. Bull."},{"key":"716_CR9","doi-asserted-by":"publisher","unstructured":"Kirienko, D.: On new infinite family of high order correlation immune unbalanced Boolean functions. In: Proceedings 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, June 30 \u2013 July 5, 2002, page 465. IEEE (2002). https:\/\/doi.org\/10.1109\/ISIT.2002.1023737","DOI":"10.1109\/ISIT.2002.1023737"},{"key":"716_CR10","doi-asserted-by":"publisher","unstructured":"Krotov, D.S.: On the OA(1536,13,2,7) and related orthogonal arrays. Discrete Math. 343(2), 111659\/1\u201311 (2020). https:\/\/doi.org\/10.1016\/j.disc.2019.111659","DOI":"10.1016\/j.disc.2019.111659"},{"key":"716_CR11","doi-asserted-by":"publisher","unstructured":"Krotov, D.S., Vorob\u2019ev, K.V.: On unbalanced Boolean functions with best correlation immunity. Electr. J. Comb. 27(1):#P1.45(1\u201324) (2020). https:\/\/doi.org\/10.37236\/8557","DOI":"10.37236\/8557"},{"key":"716_CR12","doi-asserted-by":"publisher","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism. II. J. Symb. Comput. 60, 94\u2013112 (2014). https:\/\/doi.org\/10.1016\/j.jsc.2013.09.003","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"716_CR13","doi-asserted-by":"publisher","unstructured":"Rao, C.R.: Factorial experiments derivable from combinatorial arrangements of arrays. J. R. Stat. Soc., Suppl. 9(1), 128\u2013139 (1947). https:\/\/doi.org\/10.2307\/2983576","DOI":"10.2307\/2983576"},{"key":"716_CR14","doi-asserted-by":"publisher","unstructured":"Rasoolzadeh, S.: Classification of all $$t$$-resilient boolean functions with $$t+4$$ variables. IACR Trans. Symmetric Cryptology 2023(3), 213\u2013226 (2023). https:\/\/doi.org\/10.46586\/tosc.v2023.i3.213-226","DOI":"10.46586\/tosc.v2023.i3.213-226"},{"issue":"2","key":"716_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/jcd.20236","volume":"18","author":"ED Schoen","year":"2010","unstructured":"Schoen, E.D., Eendebak, P.T., Nguyen, M.V.M.: Complete enumeration of pure-level and mixed-level orthogonal arrays. J. Comb. Des. 18(2), 123\u2013140 (2010). https:\/\/doi.org\/10.1002\/jcd.20236","journal-title":"J. Comb. Des."},{"issue":"5","key":"716_CR16","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1214\/aoms\/1177699280","volume":"37","author":"E Seiden","year":"1966","unstructured":"Seiden, E., Zemach, R.: On orthogonal arrays. Ann. Math. Stat. 37(5), 1355\u20131370 (1966). https:\/\/doi.org\/10.1214\/aoms\/1177699280","journal-title":"Ann. Math. Stat."},{"issue":"5","key":"716_CR17","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"30","author":"T Siegenthaler","year":"1984","unstructured":"Siegenthaler, T.: Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Trans. Inf. Theory 30(5), 776\u2013780 (1984). https:\/\/doi.org\/10.1109\/TIT.1984.1056949","journal-title":"IEEE Trans. Inf. Theory"},{"key":"716_CR18","doi-asserted-by":"crossref","unstructured":"Tarannikov, Y.: On resilient Boolean functions with maximal possible nonlinearity. Cryptology ePrint Archive 2000\/005 (2000). https:\/\/eprint.iacr.org\/2000\/005","DOI":"10.1007\/3-540-44495-5_3"},{"key":"716_CR19","unstructured":"Vorobev, K.V., Fon-Der-Flaass, D.G.: On perfect $$2$$-colorings of the hypercube. Sib. \u00c8lektron. Mat. Izv. 7, 65\u201375 (2010). In Russian, with English abstract"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00716-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00716-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00716-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T06:08:24Z","timestamp":1724652504000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00716-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,26]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["716"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00716-z","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,4,26]]},"assertion":[{"value":"20 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2024","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 author declares no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}