{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:18:07Z","timestamp":1649179087344},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T00:00:00Z","timestamp":1530057600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s11786-018-0350-8","type":"journal-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T04:41:20Z","timestamp":1530074480000},"page":"349-369","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Boolean Functions: Degree and Support"],"prefix":"10.1007","volume":"12","author":[{"given":"Joan-Josep","family":"Climent","sequence":"first","affiliation":[]},{"given":"Francisco J.","family":"Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"Ver\u00f3nica","family":"Requena","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,27]]},"reference":[{"issue":"4","key":"350_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01263424","volume":"4","author":"DAM Barrington","year":"1998","unstructured":"Barrington, D.A.M., Beigel, R., Rudich, S.: Representing Boolean functions as polynomials modulo composite numbers. Comput. Complex. 4(4), 367\u2013382 (1998)","journal-title":"Comput. Complex."},{"issue":"3","key":"350_CR2","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1109\/TIT.2004.842779","volume":"51","author":"Y Borissov","year":"2005","unstructured":"Borissov, Y., Braeken, A., Nikova, S., Preneel, B.: On the covering radii of binary Reed\u2013Muller codes in the set of resilient Boolean functions. IEEE Trans. Inf. Theory 51(3), 1182\u20131189 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"350_CR3","doi-asserted-by":"crossref","unstructured":"Braeken, A., Nikov, V., Nikova, S., Preneel, B.: On Boolean functions with generalized cryptographic properties. In: Canteaut, A., Viswanathan, K. (eds.) Progress in Cryptology\u2014INDOCRYPT 2004, Volume 3348 of Lecture Notes in Computer Science, pp. 120\u2013135. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30556-9_11"},{"key":"350_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1014935513734","volume":"25","author":"C Carlet","year":"2002","unstructured":"Carlet, C., Tarannikov, Y.: Covering sequences of Boolean functions and their cryptographic significance. Des. Codes Cryptogr. 25, 263\u2013279 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"350_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1016509410000","volume":"26","author":"C Charnes","year":"2002","unstructured":"Charnes, C., R\u00f6tteler, M., Beth, T.: Homogeneous bent functions, invariants, and designs. Des. Codes Cryptogr. 26, 139\u2013154 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"350_CR6","doi-asserted-by":"crossref","unstructured":"Climent, J.-J., Garc\u00eda, F.\u00a0J., Requena, V.: Computing the degree of a Boolean function from its support. In: Chao, C.-C., Kohno, R. (eds), Proceedings of the 2010 International Symposium on Information Theory and its Applications (ISITA2010), pp. 123\u2013128. IEEE Press (2010)","DOI":"10.1109\/ISITA.2010.5649426"},{"key":"350_CR7","unstructured":"Climent, J.-J., Garc\u00eda, F.J., Requena, V.: Some algebraic properties related to the degree of a Boolean function. In: Aguiar, J.V. (ed), Proceedings of the 10th International Conference on Computational and Mathematical Methods in Science and Engineering (CMMSE 2010), pp. 373\u2013384 (2010)"},{"key":"350_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.2495\/DATA130031","volume":"45","author":"J-J Climent","year":"2013","unstructured":"Climent, J.-J., Garc\u00eda, F.J., Requena, V.: The degree of a Boolean function and some algebraic properties of its support. WIT Trans. Inf. Commun. Technol. 45, 25\u201336 (2013)","journal-title":"WIT Trans. Inf. Commun. Technol."},{"key":"350_CR9","doi-asserted-by":"crossref","unstructured":"Dawson, E., Wu, C.-K.: Construction of correlation immune Boolean functions. In: Han, Y., Okamoto, T., Qing, S. (eds.) Information and Communications Security\u2014ICIS \u201997, Volume 1334 of Lecture Notes in Computer Science, pp. 170\u2013180. Springer, Berlin (1997)","DOI":"10.1007\/BFb0028473"},{"key":"350_CR10","first-page":"147","volume":"19","author":"J Gonda","year":"2001","unstructured":"Gonda, J.: Transformation of the canonical disjunctive normal form of a Boolean function to its Zhegalkin-polynomial and back. Ann. Discrete Math. 19, 147\u2013164 (2001)","journal-title":"Ann. Discrete Math."},{"issue":"4","key":"350_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1080\/00207219008921194","volume":"68","author":"MK Habib","year":"1990","unstructured":"Habib, M.K.: Boolean matrix representation for the conversion of minterms to Reed\u2013Muller coefficients and the minimization of Exclusiove-OR switching functions. Int. J. Electron. 68(4), 493\u2013506 (1990)","journal-title":"Int. J. Electron."},{"issue":"3","key":"350_CR12","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/TIT.2004.824913","volume":"50","author":"K Kurosawa","year":"2004","unstructured":"Kurosawa, K., Iwata, T., Yoshiwara, T.: New covering radius of Reed\u2013Muller codes for \n                    \n                      \n                    \n                    $$t$$\n                    \n                      \n                        t\n                      \n                    \n                  -resilient functions. IEEE Trans. Inf. Theory 50(3), 468\u2013475 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"350_CR13","doi-asserted-by":"publisher","first-page":"2752","DOI":"10.1109\/TIT.2004.836684","volume":"50","author":"K Kurosawa","year":"2004","unstructured":"Kurosawa, K., Matsumoto, R.: Almost security of cryptographic Boolean functions. IEEE Trans. Inf. Theory 50(11), 2752\u20132761 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"350_CR14","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Satoh, T.: Design of \n                    \n                      \n                    \n                    $$SAC\/PC(l)$$\n                    \n                      \n                        \n                          S\n                          A\n                          C\n                          \/\n                          P\n                          C\n                          (\n                          l\n                          )\n                        \n                      \n                    \n                   of order \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                   Boolean functions and three other cryptographic criteria. In: Fumy, W. (ed.) Advances in Cryptology\u2014EUROCRYPT \u201997, Volume 1233 of Lecture Notes in Computer Science, pp. 434\u2013449. Springer, Berlin (1997)","DOI":"10.1007\/3-540-69053-0_30"},{"key":"350_CR15","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1988","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 6th edn. North-Holland, Amsterdam (1988)","edition":"6"},{"issue":"9","key":"350_CR16","doi-asserted-by":"publisher","first-page":"4251","DOI":"10.1109\/TIT.2006.880050","volume":"52","author":"R Matsumoto","year":"2006","unstructured":"Matsumoto, R., Kurosawa, K., Itoh, T., Konno, T., Uyematsu, T.: Primal-dual distance bounds of linear codes with application to cryptography. IEEE Trans. Inf. Theory 52(9), 4251\u20134256 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"350_CR17","doi-asserted-by":"crossref","unstructured":"Meier, W., Pasalic, E., Carlet, C.: Algebraic attacks and decomposition of Boolean functions. In: Cachin, C., Camenisch, J. (eds.) Advances in Cryptology\u2014EUROCRYPT 2004, Volume 3027 of Lecture Notes in Computer Science, pp. 474\u2013491. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-24676-3_28"},{"key":"350_CR18","doi-asserted-by":"crossref","unstructured":"Meier, W., Staffelbach, O.: Nonlinearity criteria for cryptographic functions. In: Quisquater, J.J., Vandewalle, J. (eds.) Advances in Cryptology\u2014EUROCRYPT\u201989, Volume 434 of Lecture Notes in Computer Science, pp. 549\u2013562. Springer, Berlin (1990)","DOI":"10.1007\/3-540-46885-4_53"},{"issue":"4","key":"350_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01263419","volume":"4","author":"N Nisan","year":"1998","unstructured":"Nisan, N., Szegedy, M.: On the degree of Boolean functions as real polynomials. Computat. Complex. 4(4), 301\u2013313 (1998)","journal-title":"Computat. Complex."},{"issue":"8","key":"350_CR20","first-page":"705","volume":"4","author":"D Olej\u00e1r","year":"1998","unstructured":"Olej\u00e1r, D., Stanek, M.: On cryptographic properties of random Boolean functions. J. Univ. Comput. Sci. 4(8), 705\u2013717 (1998)","journal-title":"J. Univ. Comput. Sci."},{"key":"350_CR21","doi-asserted-by":"crossref","unstructured":"Ozols, R., Freivalds, R., Ivanovs, J., Kalni\u0146a, E., L\u0101ce, L., Miyakawa, M., Hisayuki, T., Taimi\u0146a, D.: Boolean functions with a low polynomial degree and quantum query algorithms. In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005: Theory and Practice of Computer Science, Volume 3381 of Lecture Notes in Computer Science, vol. 3381, pp. 408\u2013412. Springer, Berlin (2005)","DOI":"10.1007\/978-3-540-30577-4_50"},{"key":"350_CR22","doi-asserted-by":"crossref","unstructured":"Pasalic, E., Johansson, T.: Further results on the relation between nonlinearity and resiliency for Boolean functions. In: Walker, M. (ed.) Crytography and Coding, Volume 1746 of Lecture Notes in Computer Science, pp. 35\u201344. Springer, Berlin (1999)","DOI":"10.1007\/3-540-46665-7_3"},{"key":"350_CR23","doi-asserted-by":"crossref","unstructured":"Preneel, B., Van Leekwijck, W., Van Linden, L., Govaerts, R., Vandewalle, J.: Propagation characteristics of Boolean functions. In: Damgard, I.B. (ed.) Advances in Cryptology\u2014EUROCRYPT\u201990, Volume 473 of Lecture Notes in Computer Science, pp. 161\u2013173. Springer, Berlin (1991)","DOI":"10.1007\/3-540-46877-3_14"},{"key":"350_CR24","unstructured":"Qu, C., Seberry, J., Pieprzyk, J.: On the symmetric property of homogeneous Boolean functions. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds), Proceedings of the Australasian Conference on Information Security and Privacy\u2014ACISP\u201999, Volume 1587 of Lecture Notes in Computer Science, pp. 26\u201335. Springer, Berlin, (1999)"},{"key":"350_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and Design of Stream Ciphers","author":"RA Rueppel","year":"1986","unstructured":"Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, New York (1986)"},{"issue":"1","key":"350_CR26","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1987.1057268","volume":"33","author":"RA Rueppel","year":"1987","unstructured":"Rueppel, R.A., Staffelbach, O.J.: Products of linear recurring sequences with maximum complexity. IEEE Trans. Inf. Theory 33(1), 124\u2013131 (1987)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"350_CR27","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1005769927571","volume":"46","author":"I Strazdins","year":"1997","unstructured":"Strazdins, I.: Universal affine classification of Booelan functions. Acta Applicandae Mathematicae 46, 147\u2013167 (1997)","journal-title":"Acta Applicandae Mathematicae"},{"key":"350_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2032-7","volume-title":"An Introduction to Error Correcting Codes with Applications","author":"SA Vanstone","year":"1989","unstructured":"Vanstone, S.A., van Oorschot, P.C.: An Introduction to Error Correcting Codes with Applications. Kluwer Academic Publishers, Boston (1989)"},{"issue":"12","key":"350_CR29","doi-asserted-by":"publisher","first-page":"5822","DOI":"10.1109\/TIT.2009.2032736","volume":"55","author":"W Zhang","year":"2009","unstructured":"Zhang, W., Xiao, G.: Constructions of almost optimal resilient Boolean functions on large even number of variables. IEEE Trans. Inf. Theory 55(12), 5822\u20135831 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"350_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, X.-M., Zheng, Y., Imai, H.: Duality of boolean functions and its cryptographic significance. In: Han, Y., Okamoto, T., Quing, S. (eds.) Information and Communications Security, Volume 1334 of Lecture Notes in Computer Science, pp. 159\u2013169. Springer, Berlin (1997)","DOI":"10.1007\/BFb0028472"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-018-0350-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0350-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-018-0350-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T23:12:45Z","timestamp":1561590765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-018-0350-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,27]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["350"],"URL":"https:\/\/doi.org\/10.1007\/s11786-018-0350-8","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,27]]},"assertion":[{"value":"25 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}