{"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":1770842069194,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540308058","type":"print"},{"value":"9783540322788","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11596219_9","type":"book-chapter","created":{"date-parts":[[2005,11,11]],"date-time":"2005-11-11T13:34:33Z","timestamp":1131716073000},"page":"104-117","source":"Crossref","is-referenced-by-count":3,"title":["Design Principles for Combiners with Memory"],"prefix":"10.1007","author":[{"given":"Frederik","family":"Armknecht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Krause","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Stegemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","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":"9_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":"9_CR3","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":"9_CR4","unstructured":"Armknecht, F.: On the Existence of Low-Degree Equations for Algebraic Attacks, Cryptology ePrint Archive: Report 2004\/185"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/11693383_11","volume-title":"Selected Areas in Cryptography","author":"A. Braeken","year":"2006","unstructured":"Braeken, A., Lano, J.: On the (im)possibiliy of practical and secure nonlinear filters and combiners. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 159\u2013174. Springer, Heidelberg (2006)"},{"key":"9_CR6","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":"9_CR7","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":"9_CR8","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":"9_CR9","unstructured":"Faug\u00e8re, J.-C., Ars, G.: An Algebraic Cryptanalysis of Nonlinear Filter Generators using Gr\u00f6bner Bases (2003), Available at http:\/\/www.inria.fr\/rrrt\/rr-4739.html"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-47555-9_10","volume-title":"Advances in Cryptology - EUROCRYPT 1993","author":"J.D. Goli\u0107","year":"1993","unstructured":"Goli\u0107, J.D.: Correlation via linear sequential circuit approximation of combiners with memory. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 113\u2013123. Springer, Heidelberg (1993)"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF00190805","volume":"9","author":"J.D. Goli\u0107","year":"1996","unstructured":"Goli\u0107, J.D.: Correlation Properties of General Binary Combiners with Memory. Journal of Cryptology\u00a09(2), 111\u2013126 (1996)","journal-title":"Journal of Cryptology"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.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":"9_CR13","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. Preprint Clemson Univ., to appear in Finite Field Applic (2005)","DOI":"10.1016\/j.ffa.2005.05.007"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-3-540-28628-8_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"Y. Lu","year":"2004","unstructured":"Lu, Y., Vaudenay, S.: Faster Correlation Attack on the Bluetooth Keystream Generator. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 407\u2013425. Springer, Heidelberg (2004)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-540-30539-2_34","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"Y. Lu","year":"2004","unstructured":"Lu, Y., Vaudenay, S.: Cryptanalysis of Bluetooth Keystream Generator Two-Level E0. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 483\u2013499. Springer, Heidelberg (2004)"},{"key":"9_CR16","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":"9_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and Design of Stream Ciphers","author":"R.A. Rueppel","year":"1986","unstructured":"Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)"},{"key":"9_CR18","unstructured":"Salmasizadeh, M., Goli\u0107, J.D., Dawson, E.P., Simpson, L.R.: A Systematic Procedure for Applying Fast Correlation Attacks to Combiners with Memory, SAC 1997 (1997)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1109\/TIT.1984.1056949","volume":"30","author":"T. Siegenthaler","year":"1984","unstructured":"Siegenthaler, T.: Correlation Immunity of Nonlinear Combining Functions for Cryptographic Applications. IEEE Inform. Theory\u00a0IT-30, 776\u2013780 (1984)","journal-title":"IEEE Inform. Theory"},{"key":"9_CR20","unstructured":"The Bluetooth SIG: Bluetooth SIG Lays Out Roadmap for Bluetooth Wireless Technology, SIG press release, November 8 (2004)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11596219_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:03:08Z","timestamp":1605643388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11596219_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308058","9783540322788"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11596219_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}