{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:30:12Z","timestamp":1725795012719},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_13","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T01:30:40Z","timestamp":1401672640000},"page":"167-175","source":"Crossref","is-referenced-by-count":5,"title":["On the Complexity of Computing Two Nonlinearity Measures"],"prefix":"10.1007","author":[{"given":"Magnus Gausdal","family":"Find","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity - A Modern Approach, pp. 1\u2013579. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(99)00182-6","volume":"235","author":"J. Boyar","year":"2000","unstructured":"Boyar, J., Peralta, R., Pochuev, D.: On the multiplicative complexity of Boolean functions over the basis (\u2227,\u2295,1). Theoretical Computer Science\u00a0235(1), 43\u201357 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s001450010011","volume":"13","author":"J. Boyar","year":"2000","unstructured":"Boyar, J., Damg\u00e5rd, I., Peralta, R.: Short non-interactive cryptographic proofs. J. Cryptology\u00a013(4), 449\u2013472 (2000)","journal-title":"J. Cryptology"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-38233-8_6","volume-title":"Algorithms and Complexity","author":"J. Boyar","year":"2013","unstructured":"Boyar, J., Find, M., Peralta, R.: Four measures of nonlinearity. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol.\u00a07878, pp. 61\u201372. Springer, Heidelberg (2013)"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-012-9124-7","volume":"26","author":"J. Boyar","year":"2013","unstructured":"Boyar, J., Matthews, P., Peralta, R.: Logic minimization techniques with applications to cryptology. J. Cryptology\u00a026(2), 280\u2013312 (2013)","journal-title":"J. Cryptology"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1017\/CBO9780511780448.011","volume-title":"Boolean Models and Methods in Mathematics, Computer Science, and Engineering, ch. 8","author":"C. Carlet","year":"2010","unstructured":"Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, ch. 8, pp. 257\u2013397. Cambridge Univ. Press, Cambridge (2010)"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.jco.2009.11.002","volume":"26","author":"M. Cenk","year":"2010","unstructured":"Cenk, M., \u00d6zbudak, F.: On multiplication in finite fields. J. Complexity\u00a026(2), 172\u2013186 (2010)","journal-title":"J. Complexity"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Simon, J. (ed.) STOC, pp. 11\u201319. ACM (1988)","DOI":"10.1145\/62212.62214"},{"key":"13_CR9","unstructured":"Courtois, N., Bard, G.V., Hulme, D.: A new general-purpose method to multiply 3x3 matrices using only 23 multiplications. CoRR abs\/1108.2830 (2011)"},{"key":"13_CR10","unstructured":"Daemen, J., Rijmen, V.: AES proposal: Rijndael (1999), \n                  \n                    http:\/\/csrc.nist.gov\/archive\/aes\/rijndael\/Rijndael-ammended.pdf"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci.\u00a062(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Kabanets, V., yi\u00a0Cai, J.: Circuit minimization problem. In: Yao, F.F., Luks, E.M. (eds.) STOC, pp. 73\u201379. ACM (2000)","DOI":"10.1145\/335305.335314"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","volume-title":"Automata, Languages and Programming","author":"V. Kolesnikov","year":"2008","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: Free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 486\u2013498. Springer, Heidelberg (2008)"},{"key":"13_CR16","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Book draft (2012), \n                  \n                    http:\/\/www.analysisofbooleanfunctions.org"},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jcss.1997.1494","volume":"55","author":"A.A. Razborov","year":"1997","unstructured":"Razborov, A.A., Rudich, S.: Natural proofs. J. Comput. Syst. Sci.\u00a055(1), 24\u201335 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR18","unstructured":"Sergeev, I.S.: A relation between additive and multiplicative complexity of Boolean functions. CoRR abs\/1303.4177 (2013)"},{"key":"13_CR19","unstructured":"Sloane, N., MacWilliams, F.J.: The Theory of Error-Correcting Codes. North-Holland Math. Library\u00a016 (1977)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Vaikuntanathan, V.: Computing blindfolded: New developments in fully homomorphic encryption. In: Ostrovsky, R. (ed.) FOCS, pp. 5\u201316. IEEE (2011)","DOI":"10.1109\/FOCS.2011.98"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner (1987)","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T19:51:51Z","timestamp":1558900311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}