{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:09:06Z","timestamp":1764173346114},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354819"},{"type":"electronic","value":"9783540354826"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779360_10","type":"book-chapter","created":{"date-parts":[[2006,11,16]],"date-time":"2006-11-16T03:17:10Z","timestamp":1163647030000},"page":"120-134","source":"Crossref","is-referenced-by-count":42,"title":["Open Problems Related to Algebraic Attacks on Stream Ciphers"],"prefix":"10.1007","author":[{"given":"Anne","family":"Canteaut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-60590-8_11","volume-title":"Fast Software Encryption","author":"R.J. Anderson","year":"1995","unstructured":"Anderson, R.J.: Searching for the optimum correlation attack. In: Preneel, B. (ed.) FSE 1994. LNCS, vol.\u00a01008, pp. 137\u2013143. Springer, Heidelberg (1995)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-25937-4_5","volume-title":"Fast Software Encryption","author":"F. Armknecht","year":"2004","unstructured":"Armknecht, F.: Improving fast algebraic attacks. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol.\u00a03017, pp. 65\u201382. Springer, Heidelberg (2004)"},{"key":"10_CR3","series-title":"Lecture Notes in Informatics","volume-title":"Proceedings of the Western European Workshop on Research in Cryptology (WEWoRC 2005)","author":"F. Armknecht","year":"2005","unstructured":"Armknecht, F.: Algebraic attacks and annihilators. In: Proceedings of the Western European Workshop on Research in Cryptology (WEWoRC 2005). Lecture Notes in Informatics. Springer, Heidelberg (2005)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-45146-4_10","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"F. Armknecht","year":"2003","unstructured":"Armknecht, F., Krause, M.: Algebraic attacks on combiners with memory. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 162\u2013175. Springer, Heidelberg (2003)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-30539-2_24","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"G. Ars","year":"2004","unstructured":"Ars, G., Faug\u00e8re, J.-C., Imai, H., Kawazoe, M., Sugita, M.: Comparison between XL and gr\u00f6bner basis algorithms. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 338\u2013353. Springer, Heidelberg (2004)"},{"key":"10_CR6","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: On the complexity of Gr\u00f6bner basis computation of semi-regular overdetermined algebraic equations. In: Proc. International Conference on Polynomial System Solving (ICPSS 2004) (2004)"},{"key":"10_CR7","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B., Yang, B.-Y.: Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems. In: MEGA 2005, Porto Conte, Italy (May 2005)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-540-24654-1_21","volume-title":"Selected Areas in Cryptography","author":"C. Carlet","year":"2004","unstructured":"Carlet, C., Prouff, E.: On a new notion of nonlinearity relevant to multi-output pseudo-random generators. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 291\u2013305. Springer, Heidelberg (2004)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic programming. Journal of Symbolic Computation\u00a0(9), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR10","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.T. Courtois","year":"2003","unstructured":"Courtois, N.T.: 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":"10_CR11","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":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"N.T. Courtois","year":"2000","unstructured":"Courtois, N.T., Klimov, A.B., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 392\u2013407. Springer, Heidelberg (2000)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11496618_3","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"N.T. Courtois","year":"2005","unstructured":"Courtois, N.T.: Algebraic attacks on combiners with memory and several outputs. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 3\u201320. Springer, Heidelberg (2005)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-36178-2_17","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"N.T. Courtois","year":"2002","unstructured":"Courtois, N.T., Pieprzyk, J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: ESORICS 2002. LNCS, pp. 267\u2013287. Springer, Heidelberg (2002)"},{"key":"10_CR15","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)"},{"key":"10_CR16","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.K. Dalai","year":"2005","unstructured":"Dalai, D.K., Gupta, K.C., 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":"10_CR17","unstructured":"Dalai, D.K., Sarkar, S., Maitra, S.: Balanced Boolean functions with maximum possible algebraic immunity, April 2005 (preprint)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-30539-2_23","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"C. Diem","year":"2004","unstructured":"Diem, C.: The XL-algorithm and a conjecture from commutative algebra. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 323\u2013337. Springer, Heidelberg (2004)"},{"issue":"1-3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases (F 4). Journal of Pure and Applied Algebra\u00a0139(1-3), 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10_CR20","volume-title":"Proceedings of the 2002 international symposium on Symbolic and algebraic computation","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 (F 5). In: Proceedings of the 2002 international symposium on Symbolic and algebraic computation. ACM, New York (2002)"},{"key":"10_CR21","unstructured":"Faug\u00e8re, J.-C., Ars, G.: An algebraic cryptanalysis of nonlinear filter generators using Gr\u00f6bner bases. Technical Report 4739, INRIA (2003), Available at: ftp:\/\/ftp.inria.fr\/INRIA\/publication\/publi-pdf\/RR\/RR-4739.pdf"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-45146-4_3","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.-C. Faug\u00e8re","year":"2003","unstructured":"Faug\u00e8re, J.-C., Joux, A.: Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using gr\u00f6bner bases. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 44\u201360. Springer, Heidelberg (2003)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Key, J.D., McDonough, T.P., Mavron, V.C.: Information sets and partial permutation decoding for codes from finite geometries. Finite Fields and Their Applications (to appear, 2005)","DOI":"10.1016\/j.ejc.2004.04.007"},{"key":"10_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":"10_CR25","unstructured":"Pasalic, E.: On algebraic immunity of Maiorana-McFarland like functions and applications of algebraic attack. In: Proceedings of the ECRYPT Symmetric Key Encryption Workshop (SKEW), Aarhus, Danemark (May 2005)"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell system technical journal\u00a028, 656\u2013715 (1949)","journal-title":"Bell system technical journal"},{"key":"10_CR27","unstructured":"Steel, A.: Allan Steel\u2019s Gr\u00f6bner basis timings page (2004), http:\/\/magma.maths.usyd.edu.au\/users\/allan\/gb\/"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/3-540-44598-6_31","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"M. Zhang","year":"2000","unstructured":"Zhang, M., Chan, A.H.: Maximum correlation analysis of nonlinear S-boxes in stream ciphers. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 501\u2013514. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779360_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T06:37:50Z","timestamp":1555915070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779360_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354819","9783540354826"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11779360_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}