{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:30:50Z","timestamp":1765355450659},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540938057"},{"type":"electronic","value":"9783540938064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-93806-4_18","type":"book-chapter","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T23:17:38Z","timestamp":1242775058000},"page":"329-348","source":"Crossref","is-referenced-by-count":5,"title":["Algebraic Attacks on Stream Ciphers with\u00a0Gr\u00f6bner Bases"],"prefix":"10.1007","author":[{"given":"Frederik","family":"Armknecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwenol\u00e9","family":"Ars","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,21]]},"reference":[{"key":"18_CR1","series-title":"LNCS","first-page":"65","volume-title":"Proc. of FSE\u00a02004","author":"F. Armknecht","year":"2004","unstructured":"F. Armknecht, Improving fast algebraic attacks, Proc. of FSE\u00a02004, LNCS, vol. 3017, Springer, Berlin, 2004a, pp.\u00a065\u201382."},{"unstructured":"F. Armknecht, On the existence of low-degree equations for algebraic attacks, Cryptology ePrint Archive, Report 2004\/185, 2004b, \n                  http:\/\/eprint.iacr.org\/\n                  \n                .","key":"18_CR2"},{"unstructured":"F. Armknecht, Algebraic attacks and annihilators, Proc. of WEWORC\u00a02005, LNI, vol.\u00a074, 2005, pp.\u00a013\u201321.","key":"18_CR3"},{"unstructured":"F. Armknecht, Algebraic attacks on certain stream ciphers, Ph.D. thesis, University Mannheim, Germany, 2006.","key":"18_CR4"},{"key":"18_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11554868_3","volume-title":"Proc. of Mycrypt","author":"F. Armknecht","year":"2005","unstructured":"F. Armknecht and G. Ars, Introducing a new variant of fast algebraic attacks and minimizing their successive data complexity, Proc. of Mycrypt, LNCS, vol. 3715, Springer, Berlin, 2005, pp.\u00a016\u201332."},{"doi-asserted-by":"crossref","unstructured":"F. Armknecht and M. Krause, Algebraic attacks on combiners with memory, Proc. of CRYPTO\u00a02003, LNCS, vol.\u00a02729, 2003, pp.\u00a0162\u2013175.","key":"18_CR6","DOI":"10.1007\/978-3-540-45146-4_10"},{"doi-asserted-by":"crossref","unstructured":"F. Armknecht, C. Carlet, P. Gaborit, S. K\u00fcnzli, W. Meier, and O. Ruatta, Efficient computation of algebraic immunity for algebraic and fast algebraic attacks, Proc. of Eurocrypt 2006, LNCS, vol.\u00a04004, 2006, pp.\u00a0147\u2013164.","key":"18_CR7","DOI":"10.1007\/11761679_10"},{"unstructured":"G. Ars, Applications of Gr\u00f6bner Bases to Cryptography, Ph.D. thesis, University of Rennes\u00a0I, 2005.","key":"18_CR8"},{"unstructured":"G. Ars and J.\u00a0C. Faug\u00e8re, An algebraic cryptanalysis of nonlinear filter generators using Gr\u00f6bner bases, INRIA Report 4739, 2003, \n                  http:\/\/www.inria.fr\/rrrt\/rr-4739.html\n                  \n                .","key":"18_CR9"},{"unstructured":"G. Ars and J.\u00a0C. Faug\u00e8re, Algebraic immunities of functions over finite fields, Tech. report, INRIA, 2005, \n                  ftp:\/\/ftp.inria.fr\/INRIA\/publication\n                  \n                .","key":"18_CR10"},{"unstructured":"M. Bardet, J.\u00a0C. Faugere, B. Salvy, and B.\u00a0Y. Yang, Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems, Tech. report, Talk at MEGA 2005, 2005.","key":"18_CR11"},{"unstructured":"Bluetooth specification v1.1, 1999, \n                  http:\/\/www.bluetooth.com\/\n                  \n                .","key":"18_CR12"},{"unstructured":"M. Briceno, I. Goldberg, and D. Wagner, A pedagogical implementation of A5\/1, 1998, \n                  http:\/\/jya.com\/a51-pi.htm\n                  \n                .","key":"18_CR13"},{"unstructured":"B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph.D. thesis, Innsbruck, 1965.","key":"18_CR14"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BF01844169","volume":"4","author":"B. Buchberger","year":"1970","unstructured":"B. Buchberger, Ein algorithmisches Kriterium f\u00fcr die L\u00f6sbarkeit eines algebraischen Gleichungssystems, Aequationes Math. 4 (1970), 374\u2013383.","journal-title":"Aequationes Math."},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-94-009-5225-6_6","volume-title":"Multidimensional systems theory","author":"B. Buchberger","year":"1985","unstructured":"B. Buchberger, Gr\u00f6bner-bases: An algorithmic method in polynomial ideal theory, Multidimensional systems theory, Reidel, Dordrecht, 1985, pp.\u00a0184\u2013232."},{"key":"18_CR17","first-page":"535","volume":"251","author":"B. Buchberger","year":"1998","unstructured":"B. Buchberger, An algorithmical criterion for the solvability of algebraic systems of equations, London Math. Soc. LNS 251 (1998), 535\u2013545.","journal-title":"London Math. Soc. LNS"},{"issue":"3\u20134","key":"18_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.jsc.2005.09.007","volume":"41","author":"B. Buchberger","year":"2006","unstructured":"B. Buchberger, Bruno Buchberger\u2019s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, J. Symb. Comput. 41 (2006), nos.\u00a03\u20134, 475\u2013511.","journal-title":"J. Symb. Comput."},{"key":"18_CR19","series-title":"LNCS","first-page":"165","volume-title":"Proc. of FSE\u00a02000","author":"A. Canteaut","year":"2000","unstructured":"A. Canteaut and E. Filiol, Ciphertext only reconstruction of stream ciphers based on combination generators, Proc. of FSE\u00a02000, LNCS, vol. 1978, Springer, Berlin, 2000, pp.\u00a0165\u2013180."},{"unstructured":"A. Canteaut and E. Filiol, On the influence of the filtering function on the performance of fast correlation attacks on filter generators, Proc. of Symposium on Information Theory 2002, 2002.","key":"18_CR20"},{"key":"18_CR21","series-title":"LNCS","first-page":"49","volume-title":"Proc. of FSE\u00a02004","author":"J. Cho","year":"2004","unstructured":"J. Cho and J. Pieprzyk, Algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering, Proc. of FSE\u00a02004, LNCS, vol. 3017, Springer, Berlin, 2004, pp.\u00a049\u201364."},{"key":"18_CR22","series-title":"LNCS","first-page":"176","volume-title":"Proc. of CRYPTO\u00a02003","author":"N. Courtois","year":"2003","unstructured":"N. Courtois, Fast algebraic attacks on stream ciphers with linear feedback, Proc. of CRYPTO\u00a02003, LNCS, vol. 2656, Springer, Berlin, 2003, pp.\u00a0176\u2013194."},{"key":"18_CR23","series-title":"LNCS","first-page":"345","volume-title":"Proc. of EUROCRYPT\u00a02003","author":"N. Courtois","year":"2003","unstructured":"N. Courtois and W. Meier, Algebraic attacks on stream ciphers with linear feedback, Proc. of EUROCRYPT\u00a02003, LNCS, vol. 2656, Springer, Berlin, 2003, pp.\u00a0345\u2013359."},{"key":"18_CR24","series-title":"LNCS","first-page":"359","volume-title":"Proc. of FSE\u00a02006","author":"F. Didier","year":"2006","unstructured":"F. Didier and J. Tillich, Computing the algebraic immunity efficiently, Proc. of FSE\u00a02006, LNCS, vol. 4047, Springer, Berlin, 2006, pp.\u00a0359\u2013374."},{"key":"18_CR25","first-page":"75","volume-title":"Proc. of ISSAC\u00a02002","author":"J.\u00a0C. Faug\u00e8re","year":"2002","unstructured":"J.\u00a0C. Faug\u00e8re, A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F\n                5), Proc. of ISSAC\u00a02002, ACM, New York, 2002, pp.\u00a075\u201383."},{"key":"18_CR26","first-page":"1","volume-title":"Proc. of SAC\u00a02001","author":"S. Fluhrer","year":"2001","unstructured":"S. Fluhrer, I. Mantin, and A. Shamir, Weaknesses in the key scheduling algorithm of RC4, Proc. of SAC\u00a02001, Springer, Berlin, 2001, pp.\u00a01\u201324."},{"issue":"1","key":"18_CR27","first-page":"99","volume":"46","author":"P. Geffe","year":"1973","unstructured":"P. Geffe, How to protect data with ciphers that are really hard to break, Electronics 46 (1973), no.\u00a01, 99\u2013101.","journal-title":"Electronics"},{"issue":"6","key":"18_CR28","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0020-0190(93)90076-L","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"J. H\u00e5stad, S. Phillips, and S. Safra, A well-characterized approximation problem, Inf. Process. Lett. 47 (1993), no.\u00a06, 301\u2013305.","journal-title":"Inf. Process. Lett."},{"key":"18_CR29","series-title":"LNCS","first-page":"390","volume-title":"Proc. of CRYPTO\u00a02004","author":"P. Hawkes","year":"2004","unstructured":"P. Hawkes and G. Rose, Rewriting variables: The complexity of fast algebraic attacks on stream ciphers, Proc. of CRYPTO\u00a02004, LNCS, vol. 3152, Springer, Berlin, 2004, pp.\u00a0390\u2013406."},{"unstructured":"A. Kerckhoffs, La cryptographie militaire, Journal des Sciences Militaires (1883), 161\u2013191.","key":"18_CR30"},{"key":"18_CR31","series-title":"LNCS","first-page":"34","volume-title":"Proc. of FSE2004","author":"D. Lee","year":"2004","unstructured":"D. Lee, J. Kim, J. Hong, J. Han, and D. Moon, Algebraic attacks on summation generators, Proc. of FSE2004, LNCS, vol. 3017, Springer, Berlin, 2004, pp.\u00a034\u201348."},{"key":"18_CR32","volume-title":"Introduction to finite fields and their applications","author":"R. Lidl","year":"1986","unstructured":"R. Lidl and H. Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, Cambridge, 1986."},{"key":"18_CR33","series-title":"LNCS","first-page":"474","volume-title":"Proc. of EUROCRYPT\u00a02004","author":"W. Meier","year":"2004","unstructured":"W. Meier, E. Pasalic, and C. Carlet, Algebraic attacks and decomposition of Boolean functions, Proc. of EUROCRYPT\u00a02004, LNCS, vol. 3027, Springer, Berlin, 2004, pp.\u00a0474\u2013491."},{"doi-asserted-by":"crossref","unstructured":"T. Mora, Gr\u00f6bner technology, this volume, 2009, pp.\u00a011\u201325.","key":"18_CR34","DOI":"10.1007\/978-3-540-93806-4_2"},{"key":"18_CR35","series-title":"LNCS","first-page":"260","volume-title":"Proc. of CRYPTO\u00a01985","author":"R. Rueppel","year":"1985","unstructured":"R. Rueppel, Correlation immunity and the summation generator, Proc. of CRYPTO\u00a01985, LNCS, vol. 218, Springer, Berlin, 1985, pp.\u00a0260\u2013272."},{"key":"18_CR36","first-page":"213","volume-title":"Proc. of 2nd IMA Conference on Cryptography and Coding","author":"R. Rueppel","year":"1989","unstructured":"R. Rueppel, Security models and notions for stream ciphers, Proc. of 2nd IMA Conference on Cryptography and Coding, Oxford University Press, London, 1989, pp.\u00a0213\u2013230."},{"unstructured":"R. Rueppel, Stream ciphers, Contemporary cryptology\u2014The science of information integrity, IEEE Press, 1992, pp.\u00a065\u2013134.","key":"18_CR37"},{"key":"18_CR38","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1090\/S0002-9947-1974-0349648-2","volume":"197","author":"A. Seidenberg","year":"1974","unstructured":"A. Seidenberg, Constructions in algebra, Trans. Amer. Math. Soc. 197 (1974), 273\u2013313.","journal-title":"Trans. Amer. Math. Soc."},{"key":"18_CR39","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.\u00a0E. Shannon","year":"1949","unstructured":"C.\u00a0E. Shannon, Communication theory of secrecy systems, Bell System Tech. J. 28 (1949), 656\u2013715.","journal-title":"Bell System Tech. J."},{"key":"18_CR40","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik 13 (1969), 354\u2013356.","journal-title":"Numerische Mathematik"},{"key":"18_CR41","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0196-8858(86)90028-X","volume":"7","author":"S. Wolfram","year":"1986","unstructured":"S. Wolfram, Random sequence generation by cellular automata, Advances in Applied Mathematics 7 (1986), 123\u2013169.","journal-title":"Advances in Applied Mathematics"},{"unstructured":"E. Zenner, On cryptographic properties of LFSR-based pseudorandom generators, Ph.D. thesis, Universit\u00e4t Mannheim, 2004.","key":"18_CR42"},{"issue":"7","key":"18_CR43","first-page":"405","volume":"24","author":"E. Zenner","year":"2000","unstructured":"E. Zenner, R. Weis, and S. Lucks, Sicherheit des GSM-Verschl\u00fcsselungsstandards A5, Datenschutz und Datensicherheit 24 (2000), no.\u00a07, 405\u2013407.","journal-title":"Datenschutz und Datensicherheit"}],"container-title":["Gr\u00f6bner Bases, Coding, and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-93806-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T12:19:39Z","timestamp":1619525979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-93806-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540938057","9783540938064"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-93806-4_18","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}