{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:01:39Z","timestamp":1743066099924,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439326"},{"type":"electronic","value":"9783662439333"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43933-3_30","type":"book-chapter","created":{"date-parts":[[2014,7,7]],"date-time":"2014-07-07T05:23:03Z","timestamp":1404710583000},"page":"585-604","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New Criterion for Avoiding the Propagation of Linear Relations Through an Sbox"],"prefix":"10.1007","author":[{"given":"Christina","family":"Boura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne","family":"Canteaut","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,8]]},"reference":[{"issue":"1","key":"30_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1972.1054732","volume":"18","author":"ER Berlekamp","year":"1972","unstructured":"Berlekamp, E.R., Welch, L.R.: Weight distributions of the cosets of the (32,6) Reed-Muller code. IEEE Trans. Inf. Theor. 18(1), 203\u2013207 (1972)","journal-title":"IEEE Trans. Inf. Theor."},{"unstructured":"Boura, C., Canteaut, A.: A new criterion for avoiding the propagation of linear relations through an Sbox (Full version). IACR ePrint Report 2013\/211, April 2013. http:\/\/eprint.iacr.org\/2013\/211","key":"30_CR2"},{"unstructured":"De Canni\u00e8re, C.: Analysis and Design of Symmetric Encryption Algorithms. Ph.D. thesis, Katholieke Universiteit Leuven (2007)","key":"30_CR3"},{"issue":"4","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1494","DOI":"10.1109\/18.923730","volume":"47","author":"A Canteaut","year":"2001","unstructured":"Canteaut, A., Carlet, C., Charpin, P., Fontaine, C.: On cryptographic properties of the cosets of $$R(1, m)$$. IEEE Trans. Inf. Theor. 47(4), 1494\u20131513 (2001)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.dam.2005.03.027","volume":"154","author":"A Canteaut","year":"2006","unstructured":"Canteaut, A., Daum, M., Dobbertin, H., Leander, G.: Finding nonnormal bent functions. Discret. Appl. Math. 154(2), 202\u2013218 (2006)","journal-title":"Discret. Appl. Math."},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-540-24633-6_17","volume-title":"Finite Fields and Applications","author":"C Carlet","year":"2004","unstructured":"Carlet, C., Prouff, E.: Vectorial functions and covering sequences. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds.) Fq7 2003. LNCS, vol. 2948, pp. 215\u2013248. Springer, Heidelberg (2004)"},{"issue":"2\u20133","key":"30_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.jco.2003.08.010","volume":"20","author":"P Charpin","year":"2004","unstructured":"Charpin, P.: Normal Boolean functions. J. Complex. 20(2\u20133), 245\u2013265 (2004)","journal-title":"J. Complex."},{"unstructured":"Dillon, J.F.: Elementary Hadamard Difference Sets. Ph.D. thesis, University of Maryland (1974)","key":"30_CR8"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-642-01001-9_16","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"I Dinur","year":"2009","unstructured":"Dinur, I., Shamir, A.: Cube attacks on tweakable black box polynomials. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 278\u2013299. Springer, Heidelberg (2009)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-21702-9_6","volume-title":"Fast Software Encryption","author":"I Dinur","year":"2011","unstructured":"Dinur, I., Shamir, A.: An improved algebraic attack on Hamsi-256. In: Joux, A. (ed.) FSE 2011. LNCS, vol. 6733, pp. 88\u2013106. Springer, Heidelberg (2011)"},{"key":"30_CR11","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. 1008, pp. 61\u201374. Springer, Heidelberg (1995)"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-17373-8_2","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"T Fuhr","year":"2010","unstructured":"Fuhr, T.: Finding second preimages of short messages for Hamsi-256. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 20\u201337. Springer, Heidelberg (2010)"},{"unstructured":"Fuhr, T.: Conception, preuves et analyse de fonctions de hachage cryptographiques. Ph.D. thesis, T\u00e9l\u00e9com ParisTech (2011)","key":"30_CR13"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-36178-2_29","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"CK Gupta","year":"2002","unstructured":"Gupta, C.K., Sarkar, P.: Improved construction of nonlinear resilient S-boxes. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 466\u2013483. Springer, Heidelberg (2002)"},{"unstructured":"K\u00fc\u00e7\u00fck, \u00d6: The Hash Function Hamsi. Submission to NIST (Round 2) (2009)","key":"30_CR15"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-22792-9_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Leander","year":"2011","unstructured":"Leander, G., Abdelraheem, M.A., AlKhzaimi, H., Zenner, E.: A cryptanalysis of PRINTcipher: the invariant subspace attack. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 206\u2013221. Springer, Heidelberg (2011)"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-73074-3_13","volume-title":"Arithmetic of Finite Fields","author":"G Leander","year":"2007","unstructured":"Leander, G., Poschmann, A.: On the classification of 4 Bit S-boxes. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 159\u2013176. Springer, Heidelberg (2007)"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(73)90031-9","volume":"15","author":"RL McFarland","year":"1973","unstructured":"McFarland, R.L.: A family of noncyclic difference sets. J. Comb. Theor. Ser. A 15, 1\u201310 (1973)","journal-title":"J. Comb. Theor. Ser. A"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-46416-6_32","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"K Nyberg","year":"1991","unstructured":"Nyberg, K.: Perfect nonlinear S-boxes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 378\u2013386. Springer, Heidelberg (1991)"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-60590-8_9","volume-title":"Fast Software Encryption","author":"K Nyberg","year":"1995","unstructured":"Nyberg, K.: S-boxes and round functions with controllable linearity and differential uniformity. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 111\u2013130. Springer, Heidelberg (1995)"},{"issue":"8","key":"30_CR21","doi-asserted-by":"publisher","first-page":"2182","DOI":"10.1109\/TIR.2002.800492","volume":"48","author":"E Pasalic","year":"2002","unstructured":"Pasalic, E., Maitra, S.: Linear codes in generalized construction of resilient functions with very high nonlinearity. IEEE Trans. Inf. Theor. 48(8), 2182\u20132191 (2002)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-28496-0_7","volume-title":"Selected Areas in Cryptography","author":"M-JO Saarinen","year":"2012","unstructured":"Saarinen, M.-J.O.: Cryptographic analysis of all 4 $$\\times $$ 4-Bit S-boxes. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol. 7118, pp. 118\u2013133. Springer, Heidelberg (2012)"},{"unstructured":"Wu, H.: The Hash Function JH. Submission to NIST (Round 3) (2011)","key":"30_CR23"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43933-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:47:31Z","timestamp":1630457251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-43933-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439326","9783662439333"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43933-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}