{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T09:26:37Z","timestamp":1785489997710,"version":"3.56.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T00:00:00Z","timestamp":1661904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T00:00:00Z","timestamp":1661904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011019","name":"Nemzeti Kutatsi Fejlesztsi s Innovcis Hivatal","doi-asserted-by":"publisher","award":["2018-1.2.1-NKP-2018-00004"],"award-info":[{"award-number":["2018-1.2.1-NKP-2018-00004"]}],"id":[{"id":"10.13039\/501100011019","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003549","name":"Hungarian Scientific Research Fund","doi-asserted-by":"publisher","award":["SNN 132625"],"award-info":[{"award-number":["SNN 132625"]}],"id":[{"id":"10.13039\/501100003549","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016190","name":"Trond Mohn stiftelse","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is known that correlation-immune (CI) Boolean functions used in the framework of side channel attacks need to have low Hamming weights. The supports of CI functions are (equivalently) simple orthogonal arrays, when their elements are written as rows of an array. The minimum Hamming weight of a CI function is then the same as the minimum number of rows in a simple orthogonal array. In this paper, we use Rao\u2019s Bound to give a sufficient condition on the number of rows, for a binary orthogonal array (OA) to be simple. We apply this result for determining the minimum number of rows in all simple binary orthogonal arrays of strengths 2 and 3; we show that this minimum is the same in such case as for all OA, and we extend this observation to some OA of strengths 4 and 5. This allows us to reply positively, in the case of strengths 2 and 3, to a question raised by the first author and X. Chen on the monotonicity of the minimum Hamming weight of 2-CI Boolean functions, and to partially reply positively to the same question in the case of strengths 4 and 5.<\/jats:p>","DOI":"10.1007\/s10623-022-01105-4","type":"journal-article","created":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T19:03:51Z","timestamp":1661972631000},"page":"151-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Simplicity conditions for binary orthogonal arrays"],"prefix":"10.1007","volume":"91","author":[{"given":"Claude","family":"Carlet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rebeka","family":"Kiss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9558-4197","authenticated-orcid":false,"given":"G\u00e1bor P.","family":"Nagy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,31]]},"reference":[{"issue":"3","key":"1105_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/jcd.3180030304","volume":"3","author":"J Bierbrauer","year":"1995","unstructured":"Bierbrauer J.: Bounds on orthogonal arrays and resilient functions. J. Combin. Des. 3(3), 179\u2013183 (1995). https:\/\/doi.org\/10.1002\/jcd.3180030304.","journal-title":"J. Combin. Des."},{"issue":"part 2","key":"1105_CR2","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.dam.2016.07.023","volume":"217","author":"P Boyvalenkov","year":"2017","unstructured":"Boyvalenkov P., Marinova T., Stoyanova M.: Nonexistence of a few binary orthogonal arrays. Discret. Appl. Math. 217(part 2), 144\u2013150 (2017). https:\/\/doi.org\/10.1016\/j.dam.2016.07.023.","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1105_CR3","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.jspi.2006.12.003","volume":"138","author":"DA Bulutoglu","year":"2008","unstructured":"Bulutoglu D.A., Margot F.: Classi cation of orthogonal arrays by integer programming. J. Stat. Plann. Inference 138(3), 654\u2013666 (2008). https:\/\/doi.org\/10.1016\/j.jspi.2006.12.003.","journal-title":"J. Stat. Plann. Inference"},{"key":"1105_CR4","volume-title":"Boolean Functions for Cryptography and Coding Theory","author":"C Carlet","year":"2021","unstructured":"Carlet C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021)."},{"issue":"4","key":"1105_CR5","doi-asserted-by":"publisher","first-page":"2969","DOI":"10.1109\/TIT.2017.2785775","volume":"64","author":"C Carlet","year":"2018","unstructured":"Carlet C., Chen X.: Constructing low-weight dth-order correlation-immune Boolean functions through the Fourier-Hadamard transform. IEEE Trans. Inform. Theory 64(4), 2969\u20132978 (2018). https:\/\/doi.org\/10.1109\/TIT.2017.2785775.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1105_CR6","doi-asserted-by":"crossref","unstructured":"Carlet\u2019 C., Guilley S.: Correlation-immune Boolean functions for easing counter measures to side-channel attacks. In: Algebraic Curves and Finite Fields, vol. 16, pp. 41\u201370 (2014).","DOI":"10.1515\/9783110317916.41"},{"key":"1105_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura L., Bj\u00f8rner N.: Z3: An efficient SMT solver. In: Ramakrishnan C.R., Rehof J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 337\u2013340. Springer, Berlin Heidelberg (2008)."},{"key":"1105_CR8","first-page":"133","volume":"4","author":"DG Fon-Der-Flaass","year":"2007","unstructured":"Fon-Der-Flaass D.G.: A bound on correlation immunity. Sib. Elektron. Mat. Izv. 4, 133\u2013135 (2007).","journal-title":"Sib. Elektron. Mat. Izv."},{"issue":"2","key":"1105_CR9","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1080\/01611194.2018.1517834","volume":"43","author":"A Gorodilova","year":"2019","unstructured":"Gorodilova A., et al.: Problems and solutions from the fourth International Students\u2019 Olympiad in Cryptography (NSUCRYPTO). Cryptologia 43(2), 138\u2013174 (2019). https:\/\/doi.org\/10.1080\/01611194.2018.1517834.","journal-title":"Cryptologia"},{"key":"1105_CR10","doi-asserted-by":"publisher","unstructured":"Gorodilova A., et al.: The Fifth International Students Olympiad in cryptography NSUCRYPTO: Problems and their solutions. Cryptologia 44(3), 223\u2013256 (2020). https:\/\/doi.org\/10.1080\/01611194.2019.1670282.","DOI":"10.1080\/01611194.2019.1670282"},{"key":"1105_CR11","first-page":"24","volume-title":"Orthogonal Arrays. Springer Series in Statistics. Theory and Applications With a Foreword by C. R. Rao","author":"AS Hedayat","year":"1999","unstructured":"Hedayat A.S., Sloane N.J.A., Stufken J.: Orthogonal Arrays. Springer Series in Statistics. Theory and Applications With a Foreword by C. R. Rao, p. 24. Springer-Verlag, New York (1999)."},{"issue":"2","key":"1105_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"A Kerdock","year":"1972","unstructured":"Kerdock A.: A class of low-rate nonlinear binary codes. Inf. Control 20(2), 182\u2013187 (1972). https:\/\/doi.org\/10.1016\/S0019-9958(72)90376-2.","journal-title":"Inf. Control"},{"issue":"3","key":"1105_CR13","doi-asserted-by":"publisher","first-page":"110","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), 110\u2013131 (2010). https:\/\/doi.org\/10.3103\/S0027132210030101.","journal-title":"Mosc. Univ. Math. Bull."},{"key":"1105_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.17223\/20710410\/51\/3","volume":"52","author":"R Kiss","year":"2021","unstructured":"Kiss R., Nagy G.P.: On the nonexistence of certain orthogonal arrays of strength four. Prikl. Diskretn. Mat 52, 65\u201368 (2021). https:\/\/doi.org\/10.17223\/20710410\/51\/3.","journal-title":"Prikl. Diskretn. Mat"},{"key":"1105_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111659","volume":"343","author":"DS Krotov","year":"2020","unstructured":"Krotov D.S.: On the OA(1536; 13; 2; 7) and related orthogonal arrays. Discret. Math. 343, 111659 (2020). https:\/\/doi.org\/10.1016\/j.disc.2019.111659.","journal-title":"Discret. Math."},{"issue":"1","key":"1105_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.2307\/2983576","volume":"9","author":"CR Rao","year":"1947","unstructured":"Rao C.R.: Factorial experiments derivable from combinatorial arrangements of arrays. Suppl. J. R. Stat. Soc. 9(1), 128\u2013139 (1947).","journal-title":"Suppl. J. R. Stat. Soc."},{"issue":"2","key":"1105_CR17","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. Combin. Des. 18(2), 123\u2013140 (2010). https:\/\/doi.org\/10.1002\/jcd.20236.","journal-title":"J. Combin. Des."},{"issue":"10","key":"1105_CR18","doi-asserted-by":"publisher","first-page":"2321","DOI":"10.1007\/s10623-019-00620-1","volume":"87","author":"Q Wang","year":"2019","unstructured":"Wang Q.: Hadamard matrices, d-linearly independent sets and correlation-immune Boolean functions with minimum Hamming weights. Des. Codes Cryptogr. 87(10), 2321\u20132333 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00620-1.","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1105_CR19","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/18.6037","volume":"34","author":"G-Z Xiao","year":"1988","unstructured":"Xiao G.-Z., Massey J.: A spectral characterization of correlation-immune combining functions. IEEE Trans. Inf. Theory 34(3), 569\u2013571 (1988). https:\/\/doi.org\/10.1109\/18.6037.","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01105-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01105-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01105-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T10:14:53Z","timestamp":1673086493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01105-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,31]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1105"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01105-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,31]]},"assertion":[{"value":"20 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}