{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T20:56:16Z","timestamp":1763931376347},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797180"},{"type":"electronic","value":"9783540797197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79719-7_7","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T08:04:57Z","timestamp":1210061097000},"page":"63-76","source":"Crossref","is-referenced-by-count":38,"title":["Attacking Bivium Using SAT Solvers"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Eibach","sequence":"first","affiliation":[]},{"given":"Enrico","family":"Pilz","sequence":"additional","affiliation":[]},{"given":"Gunnar","family":"V\u00f6lkel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"eSTREAM: eSTREAM \u2013 The ECRYPT Stream Cipher Project. http:\/\/www.ecrypt.eu.org\/stream\/"},{"key":"7_CR2","unstructured":"NESSIE: NESSIE \u2013 New European Schemes for Signatures, Integrity and Encryption. https:\/\/www.cosic.esat.kuleuven.be\/nessie\/"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"De Canni\u00e8re, C., Preneel, B.: TRIVIUM \u2013 a stream cipher construction inspired by block cipher design principles. eSTREAM, ECRYPT Stream Cipher Project, Report 2005\/030 (2005), http:\/\/www.ecrypt.eu.org\/stream\/trivium.html","DOI":"10.1007\/11836810_13"},{"key":"7_CR4","unstructured":"Raddum, H.: Cryptanalytic results on TRIVIUM. eSTREAM, ECRYPT Stream Cipher Project, Report 2006\/039 (2006), http:\/\/www.ecrypt.eu.org\/stream"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Le Berre, D., Simon, L.: Special Volume on the SAT 2005 competitions and evaluations. Journal of Satisfiability (JSAT) (March 2006), http:\/\/www.satcompetition.org\/","DOI":"10.3233\/SAT190013"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Maximov, A., Biryukov, A.: Two Trivial Attacks on Trivium. In: Selected Areas in Cryptography 2007, pp. 36\u201355 (2007)","DOI":"10.1007\/978-3-540-77360-3_3"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44448-3_1","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"A. Biryukov","year":"2000","unstructured":"Biryukov, A., Shamir, A.: Cryptoanalytic time\/memory\/data tradeoffs for stream ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 1\u201313. Springer, Heidelberg (2000)"},{"key":"7_CR8","unstructured":"Bard, G., Courtois, N., Jefferson, C.: Efficient Methods for Conversion and Solution of Sparse Systems of Low-Degree Multivariate Polynomials over GF(2) via SAT-Solvers. Cryptology ePrint Archiv, Report 2007\/024 (2007)"},{"key":"7_CR9","unstructured":"McDonald, C., Charnes, C., Pieprzyk, J.: Attacking Bivium with MiniSat. Cryptology ePrint Archive, Report 2007\/040 (2007)"},{"key":"7_CR10","unstructured":"DIMACS specification: http:\/\/www.satlib.org\/Benchmarks\/SAT\/satformat.ps"},{"key":"7_CR11","unstructured":"Pipatsrisawat, K., Darwiche, A.: RSat 2.0: SAT Solver Description. Technical report D153. Automated Reasoning Group, Computer Science Department, University of California, Los Angeles (2007), http:\/\/reasoning.cs.ucla.edu\/rsat\/"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Een","year":"2005","unstructured":"Een, N., Sorensson, N.: MiniSat \u2013 A SAT Solver with Conflict-Clause Minimization. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, Springer, Heidelberg (2005), http:\/\/www.cs.chalmers.se\/Cs\/Research\/FormalMethods\/MiniSat\/MiniSat.html"},{"key":"7_CR13","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719789","volume-title":"Branching Programs and Binary Decision Diagrams","author":"I. Wegener","year":"2000","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-46035-7_15","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"M. Krause","year":"2002","unstructured":"Krause, M.: BDD-Based Cryptanalysis of Keystream Generators. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 237\u2013239. Springer, Heidelberg (2002)"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00224-005-1282-8","volume":"40","author":"M. Krause","year":"2007","unstructured":"Krause, M.: OBDD-Based Cryptanalysis of Oblivious Keystream Generators. Theory of Computing Systems\u00a040(1), 101\u2013121 (2007)","journal-title":"Theory of Computing Systems"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11799313_11","volume-title":"Fast Software Encryption","author":"M. Krause","year":"2006","unstructured":"Krause, M., Stegemann, D.: Reducing the space complexity of BDD-based attacks on keystream generators. In: Robshaw, M.J.B. (ed.) FSE 2006. LNCS, vol.\u00a04047, pp. 163\u2013178. Springer, Heidelberg (2006)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Stegemann, D.: Extended BDD-based Cryptanalysis of Keystream Generators. In: Proceedings of SAC 2007. LNCS, vol.\u00a04876, pp. 17\u201335 (2007)","DOI":"10.1007\/978-3-540-77360-3_2"},{"key":"7_CR18","unstructured":"Somenzi, F.: CUDD, version 2.4.1, University of Colorado, http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/"},{"key":"7_CR19","unstructured":"Stein, W.: Sage Mathematics Software (Version 2.9.2) The SAGE\u00a0Group (2007), http:\/\/www.sagemath.org ."},{"key":"7_CR20","unstructured":"Greuel, G.-M., Pfister, G., Sch\u00f6nemann, H.: Singular 3.0.4. A Computer Algebra System for Polynomial Computations. Centre for Computer Algebra, University of Kaiserslautern (2007), http:\/\/www.singular.uni-kl.de\/"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45654-6_1","volume-title":"Computer Aided Systems Theory - EUROCAST 2001","author":"B. Buchberger","year":"2001","unstructured":"Buchberger, B.: Gr\u00f6bner Bases: A Short Introduction for System Theorists. In: Moreno-D\u00edaz Jr., R., Buchberger, B., Freire, J.-L. (eds.) EUROCAST 2001. LNCS, vol.\u00a02178, pp. 1\u201314. Springer, Heidelberg (2001)"},{"key":"7_CR22","unstructured":"Brickenstein, M.: Slimgb: Gr\u00f6bner Bases with Slim Polynomials. Reports on Computer Algebra 35, ZCA, University of Kaiserslautern (2005)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79719-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:20:09Z","timestamp":1606184409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79719-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797180","9783540797197"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79719-7_7","relation":{},"subject":[]}}