{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T13:26:30Z","timestamp":1764077190450},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_6","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"61-72","source":"Crossref","is-referenced-by-count":11,"title":["Four Measures of Nonlinearity"],"prefix":"10.1007","author":[{"given":"Joan","family":"Boyar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Find","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Peralta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s001450010011","volume":"13","author":"J. Boyar","year":"2000","unstructured":"Boyar, J., Damgaard, I., Peralta, R.: Short non-interactive cryptographic proofs. Journal of Cryptology 13, 449\u2013472 (2000)","journal-title":"Journal of Cryptology"},{"issue":"1-3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.tcs.2008.01.030","volume":"396","author":"J. Boyar","year":"2008","unstructured":"Boyar, J., Peralta, R.: Tight bounds for the multiplicative complexity of symmetric functions. Theor. Comput. Sci.\u00a0396(1-3), 223\u2013246 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR3","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 (\u2009\u2227\u2009,\u2009\u2295\u2009, 1). Theor. Comput. Sci.\u00a0235(1), 43\u201357 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"8","key":"6_CR4","doi-asserted-by":"publisher","first-page":"2791","DOI":"10.1109\/TIT.2005.851743","volume":"51","author":"A. Canteaut","year":"2005","unstructured":"Canteaut, A., Videau, M.: Symmetric Boolean functions. IEEE Transactions on Information Theory\u00a051(8), 2791\u20132811 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"6_CR5","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1109\/TIT.2004.833361","volume":"50","author":"C. Carlet","year":"2004","unstructured":"Carlet, C.: On the degree, nonlinearity, algebraic thickness, and nonnormality of Boolean functions, with developments on symmetric functions. IEEE Transactions on Information Theory\u00a050(9), 2178\u20132185 (2004)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR6","doi-asserted-by":"crossref","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":"7","key":"6_CR7","doi-asserted-by":"publisher","first-page":"3105","DOI":"10.1109\/TIT.2006.876253","volume":"52","author":"C. Carlet","year":"2006","unstructured":"Carlet, C., Dalai, D.K., Gupta, K.C., Maitra, S.: Algebraic immunity for cryptographically significant Boolean functions: Analysis and construction. IEEE Transactions on Information Theory\u00a052(7), 3105\u20133121 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-39200-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"N. Courtois","year":"2003","unstructured":"Courtois, N., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 345\u2013359. Springer, Heidelberg (2003)"},{"key":"6_CR9","unstructured":"Courtois, N., Hulme, D., Mourouzis, T.: Solving circuit optimisation problems in cryptography and cryptanalysis, e-print can be found at http:\/\/eprint.iacr.org\/2011\/475.pdf"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-30556-9_9","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"D.K. Dalai","year":"2004","unstructured":"Dalai, D.K., Gupta, K.C., Maitra, S.: Results on algebraic immunity for cryptographically significant Boolean functions. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol.\u00a03348, pp. 92\u2013106. Springer, Heidelberg (2004)"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10623-005-6300-x","volume":"40","author":"D.K. Dalai","year":"2006","unstructured":"Dalai, D.K., Maitra, S., Sarkar, S.: Basic theory in construction of Boolean functions with maximum possible annihilator immunity. Des. Codes Cryptography\u00a040(1), 41\u201358 (2006)","journal-title":"Des. Codes Cryptography"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-22993-0_25","volume-title":"Mathematical Foundations of Computer Science 2011","author":"E. Demenkov","year":"2011","unstructured":"Demenkov, E., Kulikov, A.S.: An elementary proof of a 3n \u2212 o(n) lower bound on the circuit complexity of affine dispersers. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 256\u2013265. Springer, Heidelberg (2011)"},{"issue":"10","key":"6_CR13","doi-asserted-by":"publisher","first-page":"4496","DOI":"10.1109\/TIT.2006.881719","volume":"52","author":"F. Didier","year":"2006","unstructured":"Didier, F.: A new upper bound on the block error probability after decoding over the erasure channel. IEEE Transactions on Information Theory\u00a052(10), 4496\u20134503 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-60590-8_5","volume-title":"Fast Software Encryption","author":"H. Dobbertin","year":"1995","unstructured":"Dobbertin, H.: Construction of bent functions and balanced Boolean functions with high nonlinearity. In: Preneel, B. (ed.) FSE 1994. LNCS, vol.\u00a01008, pp. 61\u201374. Springer, Heidelberg (1995)"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. ACM, New York (1987), http:\/\/doi.acm.org\/10.1145\/28395.28420"},{"key":"6_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24508-4","volume-title":"Boolean Function Complexity: Advances and Frontiers","author":"S. Jukna","year":"2012","unstructured":"Jukna, S.: Boolean Function Complexity: Advances and Frontiers. Springer, Heidelberg (2012)"},{"key":"6_CR17","unstructured":"Kavut, S., Maitra, S., Y\u00fccel, M.D.: There exist Boolean functions on n (odd) variables having nonlinearity > 2n\u2009\u2212\u20091 - 2(n\u2009\u2212\u20091)\/2 if and only if n>7. IACR Cryptology ePrint Archive 2006, 181 (2006)"},{"key":"6_CR18","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":"6_CR19","first-page":"1171","volume":"111","author":"O. Lupanov","year":"1965","unstructured":"Lupanov, O.: On rectifier and switching-and-rectifier schemes. Dokl. Akad. 30 Nauk SSSR 111, 1171-1174 (1965)","journal-title":"Dokl. Akad. 30 Nauk SSSR"},{"issue":"9","key":"6_CR20","doi-asserted-by":"publisher","first-page":"2626","DOI":"10.1109\/TIT.2002.801482","volume":"48","author":"S. Maitra","year":"2002","unstructured":"Maitra, S., Sarkar, P.: Maximum nonlinearity of symmetric Boolean functions on odd number of variables. IEEE Transactions on Information Theory\u00a048(9), 2626\u20132630 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/0097-3165(90)90009-L","volume":"54","author":"R.L. McFarland","year":"1990","unstructured":"McFarland, R.L.: Sub-difference sets of Hadamard difference sets. J. Comb. Theory, Ser. A\u00a054(1), 112\u2013122 (1990)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"6_CR22","first-page":"123","volume":"8","author":"E.I. Nechiporuk","year":"1962","unstructured":"Nechiporuk, E.I.: On the complexity of schemes in some bases containing nontrivial elements with zero weights (in Russian). Problemy Kibernetiki\u00a08, 123\u2013160 (1962)","journal-title":"Problemy Kibernetiki"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"CRYPTO 2012","author":"J.B. Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini, R. (ed.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 681\u2013700. Springer, Heidelberg (2012)"},{"key":"6_CR24","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Book Draft (2012), http:\/\/www.analysisofbooleanfunctions.org"},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10623-005-6363-8","volume":"40","author":"F. Rodier","year":"2006","unstructured":"Rodier, F.: Asymptotic nonlinearity of Boolean functions. Des. Codes Cryptography\u00a040(1), 59\u201370 (2006)","journal-title":"Des. Codes Cryptography"},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"O.S. Rothaus","year":"1976","unstructured":"Rothaus, O.S.: On \u201cbent\u201d functions. J. Comb. Theory, Ser. A\u00a020(3), 300\u2013305 (1976)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"4","key":"6_CR27","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1006\/eujc.1994.1044","volume":"15","author":"P. Savick\u00fd","year":"1994","unstructured":"Savick\u00fd, P.: On the bent Boolean functions that are symmetric. Eur. J. Comb.\u00a015(4), 407\u2013410 (1994)","journal-title":"Eur. J. Comb."},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-51083-4_47","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"C.-P. Schnorr","year":"1989","unstructured":"Schnorr, C.-P.: The multiplicative complexity of Boolean functions. In: Mora, T. (ed.) AAECC 1988. LNCS, vol.\u00a0357, pp. 45\u201358. Springer, Heidelberg (1989)"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/11927587_8","volume-title":"Information Security and Cryptology \u2013 ICISC 2006","author":"X.-M. Zhang","year":"2006","unstructured":"Zhang, X.-M., Pieprzyk, J., Zheng, Y.: On algebraic immunity and annihilators. In: Rhee, M.S., Lee, B. (eds.) ICISC 2006. LNCS, vol.\u00a04296, pp. 65\u201380. Springer, Heidelberg (2006)"},{"key":"6_CR30","first-page":"9","volume":"43","author":"I.I. Zhegalkin","year":"1927","unstructured":"Zhegalkin, I.I.: On the technique of calculating propositions in symbolic logic. Matematicheskii Sbornik\u00a043, 9\u201328 (1927)","journal-title":"Matematicheskii Sbornik"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T19:18:54Z","timestamp":1688239134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}