{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T20:34:29Z","timestamp":1770842069082,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540331087","type":"print"},{"value":"9783540331094","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11693383_11","type":"book-chapter","created":{"date-parts":[[2006,2,25]],"date-time":"2006-02-25T05:55:05Z","timestamp":1140846905000},"page":"159-174","source":"Crossref","is-referenced-by-count":14,"title":["On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners"],"prefix":"10.1007","author":[{"given":"An","family":"Braeken","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Lano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02620228","volume":"6","author":"G. Agnew","year":"1993","unstructured":"Agnew, G., Beth, T., Mullin, R., Vanstone, S.: Arithmetic operations in GF(2 m ). Journal of Cryptology\u00a06(1), 3\u201313 (1993)","journal-title":"Journal of Cryptology"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-30564-4_2","volume-title":"Selected Areas in Cryptography","author":"F. Armknecht","year":"2004","unstructured":"Armknecht, F., Lano, J., Preneel, B.: Extending the resynchronization attack. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 19\u201338. Springer, Heidelberg (2004)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Babbage, S.: Space\/time trade-off in exhaustive search attacks on stream ciphers. Eurocrypt Rump session (1996)","DOI":"10.1049\/cp:19950490"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Braeken, A.: On the algebraic immunity of symmetric boolean functions. Technical report, K.U. Leuven (2005)","DOI":"10.1007\/11596219_4"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Braeken, A., Lano, J.: On the (im)possibility of practical and secure nonlinear filters and combiners (extended version). COSIC technical report (2005), https:\/\/www.cosic.esat.kuleuven.be\/publications\/","DOI":"10.1007\/11693383_11"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-45539-6_40","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"A. Canteaut","year":"2000","unstructured":"Canteaut, A., Trabbia, M.: Improved fast correlation attacks using parity-check equations of weight 4 and 5. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 573\u2013588. Springer, Heidelberg (2000)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Canteaut, A., Videau, M.: Symmetric Boolean functions. IEEE Trans. Inform. Theory (2004) (to appear); Regular paper","DOI":"10.1109\/TIT.2005.851743"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Carlet, C., Gaborit, P.: On the construction of balanced Boolean functions with a good algebraic immunity. In: Proceedings of First Workshop on Boolean Functions: Cryptography and Applications, Rouen (March 2005)","DOI":"10.1109\/ISIT.2005.1523510"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-45146-4_11","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"N. Courtois","year":"2003","unstructured":"Courtois, N.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 176\u2013194. Springer, Heidelberg (2003)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Courtois, N.: Cryptanalysis of sfinks. ECRYPT Stream Cipher Project (2005)","DOI":"10.1007\/11734727_22"},{"key":"11_CR11","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-39200-9_21"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-48285-7_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"J. Daemen","year":"1994","unstructured":"Daemen, J., Govaerts, R., Vandewalle, J.: Resynchronization weaknesses in synchronous stream ciphers. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 159\u2013167. Springer, Heidelberg (1994)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11502760_7","volume-title":"Fast Software Encryption","author":"D. Dalai","year":"2005","unstructured":"Dalai, D., Gupta, K., Maitra, S.: Cryptographically significant boolean functions: Construction and analysis in terms of algebraic immunity. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol.\u00a03557, pp. 98\u2013111. Springer, Heidelberg (2005)"},{"key":"11_CR14","first-page":"139","volume":"9","author":"H. Dobbertin","year":"1998","unstructured":"Dobbertin, H.: One-to-one highly nonlinear power functions on GF(2 n ). Applicable Algebra in Engineering. Communication, and Computation\u00a09, 139\u2013152 (1998)","journal-title":"Communication, and Computation"},{"issue":"1-2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2764","volume":"151","author":"H. Dobbertin","year":"1999","unstructured":"Dobbertin, H.: Almost perfect nonlinear power functions on GF(2 n ): The Niho case. Information and Computation\u00a0151(1-2), 57\u201372 (1999)","journal-title":"Information and Computation"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Dobbertin, H., Helleseth, T., Kumar, V., Martinsen, H.: Ternary m-sequences with three-valued crosscorrelation: New decimations of Welch and Niho type. IEEE Transactions on Information Theory, IT-47, 1473\u20131481 (2001)","DOI":"10.1109\/18.923728"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-30564-4_3","volume-title":"Selected Areas in Cryptography","author":"H. Englund","year":"2004","unstructured":"Englund, H., Johansson, T.: A new simple technique to attack filter generators and related ciphers. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 39\u201353. Springer, Heidelberg (2004)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/780506.780516","volume-title":"International Symposium on Symbolic and Algebraic Computation - ISSAC 2002","author":"J.-C. Faug\u00e8re","year":"2002","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: International Symposium on Symbolic and Algebraic Computation - ISSAC 2002, pp. 75\u201383. ACM Press, New York (2002)"},{"issue":"21","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.1049\/el:19961338","volume":"32","author":"J. Golic","year":"1996","unstructured":"Golic, J.: Computation of low-weight parity-check polynomials. Electronics Letters\u00a032(21), 1981\u20131982 (1996)","journal-title":"Electronics Letters"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-540-28628-8_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"P. Hawkes","year":"2004","unstructured":"Hawkes, P., Rose, G.: Rewriting variables: The complexity of fast algebraic attacks on stream ciphers. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 390\u2013406. Springer, Heidelberg (2004)"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0019-9958(71)90473-6","volume":"18","author":"T. Kasami","year":"1971","unstructured":"Kasami, T.: The weight enumerators for several classes of subcodes of the second order binary Reed-Muller codes. Information and Control\u00a018, 369\u2013394 (1971)","journal-title":"Information and Control"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1109\/TIT.1976.1055626","volume":"22","author":"E. Key","year":"1976","unstructured":"Key, E.: An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Transactions on Information Theory\u00a022, 732\u2013736 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR23","unstructured":"Massey, J., Omura, J.: Computational method and apparatus for finite field arithmetic. US Patent No. 4, 587, 627 (1986)"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-24676-3_28","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"W. Meier","year":"2004","unstructured":"Meier, W., Pasalic, E., Carlet, C.: Algebraic attacks and decomposition of boolean functions. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 474\u2013491. Springer, Heidelberg (2004)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-540-28628-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"H. Molland","year":"2004","unstructured":"Molland, H., Helleseth, T.: An improved correlation attack against irregular clocked and filtered keystream generators. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 373\u2013389. Springer, Heidelberg (2004)"},{"key":"11_CR26","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(88)90090-X","volume":"22","author":"R. Mullin","year":"1989","unstructured":"Mullin, R., Onyszchuk, I., Vanstone, S.: Optimal normal bases in GF(p n ). Discrete Applied Mathematics\u00a022, 149\u2013161 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-45600-7_21","volume-title":"Information and Communications Security","author":"P. Ning","year":"2001","unstructured":"Ning, P., Yin, Y.L.: Efficient software implementation for finite field multiplication in normal basis. In: Qing, S., Okamoto, T., Zhou, J. (eds.) ICICS 2001. LNCS, vol.\u00a02229, pp. 177\u2013188. Springer, Heidelberg (2001)"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-48285-7_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"K. Nyberg","year":"1994","unstructured":"Nyberg, K.: Differentially uniform mappings for cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 55\u201364. Springer, Heidelberg (1994)"},{"key":"11_CR29","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1090\/S0002-9947-1933-1501703-0","volume":"35","author":"O. Ore","year":"1933","unstructured":"Ore, O.: On a special class of polynomials. Trans. Amer. Math. Soc.\u00a035, 559\u2013584 (1933)","journal-title":"Trans. Amer. Math. Soc."},{"key":"11_CR30","unstructured":"Paar, C.: Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields. Doctoral dissertation, Institute for Experimental Mathematics, University of Essen, Germany (1994)"},{"issue":"3","key":"11_CR31","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1109\/TC.2003.1244936","volume":"52","author":"A. Reyhani-Masoleh","year":"2003","unstructured":"Reyhani-Masoleh, A., Hasan, A.: Fast normal basis multiplication using general purpose processors. IEEE Transaction on Computers\u00a052(3), 1379\u20131390 (2003)","journal-title":"IEEE Transaction on Computers"},{"key":"11_CR32","unstructured":"Rose, G., Hawkes, P.: On the applicability of distinguishing attacks against stream ciphers. In: Proceedings of the 3rd NESSIE Workshop, p. 6 (2002)"},{"key":"11_CR33","first-page":"65","volume-title":"Contemporary Cryptology. The Science of Information Integrity","author":"R. Rueppel","year":"1991","unstructured":"Rueppel, R.: Stream ciphers. In: Simmons, G. (ed.) Contemporary Cryptology. The Science of Information Integrity, pp. 65\u2013134. IEEE Press, Los Alamitos (1991)"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Siegenthaler, T.: Correlation-immunity of nonlinear combining functions for cryptographic applications. IEEE Transactions on Information Theory IT- 30(5), 776\u2013780 (1984)","DOI":"10.1109\/TIT.1984.1056949"},{"key":"11_CR35","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik\u00a013, 354\u2013356 (1969)","journal-title":"Numerische Mathematik"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11693383_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:39:39Z","timestamp":1736285979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11693383_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540331087","9783540331094"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/11693383_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}