{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:47:56Z","timestamp":1761662876501},"publisher-location":"Berlin, Heidelberg","reference-count":55,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140808"},{"type":"electronic","value":"9783642140815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14081-5_2","type":"book-chapter","created":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T16:22:49Z","timestamp":1285345369000},"page":"19-36","source":"Crossref","is-referenced-by-count":2,"title":["Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems"],"prefix":"10.1007","author":[{"given":"Kenneth","family":"Koon-Ho Wong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory V.","family":"Bard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"BOINC: Berkeley Open Infrastructure for Network Computing, http:\/\/boinc.berkeley.edu\/"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11780656_1","volume-title":"Information Security and Privacy","author":"S. Al-Hinai","year":"2006","unstructured":"Al-Hinai, S., Batten, L., Colbert, B., Wong, K.K.H.: Algebraic attacks on clock-controlled stream ciphers. In: Batten, L.M., Safavi-Naini, R. (eds.) ACISP 2006. LNCS, vol.\u00a04058, pp. 1\u201316. Springer, Heidelberg (2006)"},{"issue":"4","key":"2_CR3","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1090\/S0894-0347-1990-1065053-0","volume":"3","author":"N. Alon","year":"1990","unstructured":"Alon, N., Semour, P., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. Journal of the American Mathematical Society\u00a03(4), 801\u2013808 (1990)","journal-title":"Journal of the American Mathematical Society"},{"key":"2_CR4","unstructured":"Arditti, D., Berbain, C., Billet, O., Gilbert, H., Patarin, J.: QUAD: Overview and recent developments. In: Biham, E., Handschuh, H., Lucks, S., Rijmen, V. (eds.) Symmetric Cryptography. Dagstuhl Seminar Proceedings, vol.\u00a007021. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany (2007)"},{"key":"2_CR5","unstructured":"Bard, G.V.: Algorithms for solving linear and polynomial systems of equations over finite fields with applications to cryptanalysis. Ph.D. thesis, Department of Applied Mathematics and Scientific Computation, University of Maryland, College Park (August 2007), http:\/\/www.math.umd.edu\/~bardg\/bard_thesis.pdf"},{"key":"2_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88757-9","volume-title":"Algebraic Cryptanalysis","author":"G.V. Bard","year":"2009","unstructured":"Bard, G.V.: Algebraic Cryptanalysis. Springer, Heidelberg (2009)"},{"key":"2_CR7","unstructured":"Bard, G.V., 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 Archive, Report 2007\/024 (2007), http:\/\/eprint.iacr.org\/2007\/024.pdf"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-36605-9_14","volume-title":"Applications of Evolutionary Computing","author":"R. Ba\u00f1os","year":"2003","unstructured":"Ba\u00f1os, R., Gil, C., Ortega, J., Montoya, F.G.: Multilevel heuristic algorithm for graph partitioning. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 143\u2013153. Springer, Heidelberg (2003)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11761679_8","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C. Berbain","year":"2006","unstructured":"Berbain, C., Gilbert, H., Patarin, J.: QUAD: A practical stream cipher with provable security. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 109\u2013128. Springer, Heidelberg (2006)"},{"key":"2_CR10","unstructured":"Bernstein, D.: Response to slid pairs in Salsa20 and Trivium. Tech. rep., The University of Illinois, Chicago (2008), http:\/\/cr.yp.to\/snuffle\/reslid-20080925.pdf"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1002\/1097-024X(200009)30:11<1285::AID-SPE340>3.0.CO;2-W","volume":"30","author":"J. Berry","year":"2000","unstructured":"Berry, J., Dean, N., Goldberg, M., Shannon, G., Skiena, S.: Graph computation with LINK. Software: Practice and Experience\u00a030, 1285\u20131302 (2000)","journal-title":"Software: Practice and Experience"},{"key":"2_CR12","unstructured":"Black, M., Bard, G.: SAT over BOINC: Satisfiability solving over a volunteer grid. Draft Article (2010) (Submitted for Publication), http:\/\/www.math.umd.edu\/~bardg\/publications.html"},{"issue":"3-4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The MAGMA algebra system. I. The user language. Journal of Symbolic Computation\u00a024(3-4), 235\u2013265 (1997)","journal-title":"Journal of Symbolic Computation"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-74143-5_17","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Chase","year":"2007","unstructured":"Chase, M., Lysyanskaya, A.: Simulatable vrfs with applications to multi-theorem nizk. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 303\u2013322. Springer, Heidelberg (2007)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","first-page":"49","volume-title":"Fast Software Encryption","author":"J.Y. Cho","year":"2004","unstructured":"Cho, J.Y., Pieprzyk, J.: Algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol.\u00a03017, pp. 49\u201364. Springer, Heidelberg (2004)"},{"key":"2_CR16","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. Courtois","year":"2005","unstructured":"Courtois, N.: 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":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 cipher with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656. Springer, Heidelberg (2003)"},{"key":"2_CR18","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. Courtois","year":"2000","unstructured":"Courtois, N., Shamir, A., Patarin, J., Klimov, 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":"2_CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718881","volume-title":"Direct methods for sparse linear systems, Fundamentals of Algorithms","author":"T.A. Davis","year":"2006","unstructured":"Davis, T.A.: Direct methods for sparse linear systems, Fundamentals of Algorithms, vol.\u00a02. SIAM, Philadelphia (2006)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"De Canni\u00e8re, C., Preneel, B.: Trivium specifications. Tech. rep., Katholieke Universiteit Leuven (2007), http:\/\/www.ecrypt.eu.org\/stream\/p3ciphers\/trivium\/trivium_p3.pdf","DOI":"10.1007\/978-3-540-68351-3_18"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Dinur, I., Shamir, A.: Cube attacks on tweakable black box polynomials. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 278\u2013299. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-01001-9_16"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Minisat \u2014 a SAT solver with conflict-clause minimization. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-79719-7_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"T. Eibach","year":"2008","unstructured":"Eibach, T., Pilz, E., V\u00f6lkel, G.: Attacking Bivium using SAT solvers. In: B\u00fcning, H. K., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 63\u201376. Springer, Heidelberg (2008)"},{"key":"2_CR24","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 computer Gr\u00f6bner bases (f 4). Journal of Pure and Applied Algebra\u00a0139, 61\u201388 (1999)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Fiduccia, C., Mattheyses, R.: A linear time heuristic for improving network partitions. In: 19th ACM\/IEEE Design Automation Conference, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"2_CR26","unstructured":"Fremuth-Paeger, C.: Goblin: A graph object library for network programming problems (2007), http:\/\/goblin2.sourceforge.net\/"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","volume":"5","author":"J.R. Gilbert","year":"1984","unstructured":"Gilbert, J.R., Hutchinson, J.P., Tarjan, R.E.: A separation theorem for graphs of bounded genus. Journal of Algorithms\u00a05, 391\u2013407 (1984)","journal-title":"Journal of Algorithms"},{"key":"2_CR28","unstructured":"Gilbert, J.R., Teng, S.H.: Meshpart: Matlab mesh partitioning and graph separator toolbox (2002), http:\/\/www.cerfacs.fr\/algor\/Softs\/MESHPART"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: The Chaco user\u2019s guide: Version 2.0. Tech. Rep. SAND94-2692, Sandia National Laboratories (1994)","DOI":"10.2172\/10106339"},{"key":"2_CR30","volume-title":"1995 ACM\/IEEE Supercomputing Conference","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: 1995 ACM\/IEEE Supercomputing Conference. ACM, New York (1995)"},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/0196-6774(87)90021-6","volume":"8","author":"D.S. Johnson","year":"1987","unstructured":"Johnson, D.S.: The NP-completeness column: An on-going guide. J. Algorithms\u00a08, 438\u2013448 (1987)","journal-title":"J. Algorithms"},{"issue":"1","key":"2_CR32","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing\u00a020(1), 359\u2013392 (1999)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"2_CR33","unstructured":"Karypis, G., et al.: Metis \u2014 Serial graph partitioning and fill-reducing matrix ordering (1998), http:\/\/glaros.dtc.umn.edu\/gkhome\/views\/metis\/"},{"key":"2_CR34","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1970","unstructured":"Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphics. Bell Systems Technical Journal\u00a049, 291\u2013307 (1970)","journal-title":"Bell Systems Technical Journal"},{"key":"2_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-642-00862-7_11","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"D. Khovratovich","year":"2009","unstructured":"Khovratovich, D., Biryukov, D., Nikolic, I.: Speeding up collision search for byte-oriented hash functions. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009. LNCS, vol.\u00a05677, pp. 164\u2013181. Springer, Heidelberg (2009)"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-48910-X_15","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"A. Kipnis","year":"1999","unstructured":"Kipnis, A., Patarin, J., Goubin, L.: Unbalanced oil and vinegar signature schemes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 206\u2013222. Springer, Heidelberg (1999)"},{"key":"2_CR37","volume-title":"Introduction to Parallel Computing: Design and Analysis of Algorithms","author":"V. Kumar","year":"1994","unstructured":"Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin\/Cummings Publishing Company, Redwood City (1994)"},{"issue":"2","key":"2_CR38","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics\u00a036(2), 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"2_CR39","unstructured":"Maximov, A., Biryukov, A.: Two trivial attacks on Trivium. In: Adams, C.M., Miri, A., Wiener, M.J. (eds.) SAC 2007. LNCS, vol.\u00a04876, pp. 36\u201355. Springer, Heidelberg (2007), http:\/\/eprint.iacr.org\/2007\/021"},{"key":"2_CR40","unstructured":"McDonald, C., Charnes, C., Pieprzyk, J.: An algebraic analysis of Trivium ciphers based on the boolean satisfiability problem. In: Presented at the International Conference on Boolean Functions: Cryptography and Applications, BFCA2008 (2008), Cryptology ePrint Archive, Report 2007\/129 (2007), http:\/\/eprint.iacr.org\/2007\/129"},{"key":"2_CR41","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen Kurventheorie. Fundamenta Mathematicae\u00a010, 96\u2013115 (1927)","journal-title":"Fundamenta Mathematicae"},{"key":"2_CR42","first-page":"57","volume-title":"Graph Theory and Sparse Matrix Computation. The IMA Volumes in Mathematics and its Application","author":"G.L. Miller","year":"1993","unstructured":"Miller, G.L., Teng, S.H., Thurston, W., Vavasis, S.A.: Automatic mesh partitioning. In: George, A., Gilbert, J., Liu, J. (eds.) Graph Theory and Sparse Matrix Computation. The IMA Volumes in Mathematics and its Application, vol.\u00a056, pp. 57\u201384. Springer, Heidelberg (1993)"},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02257778","volume":"46","author":"R. M\u00fcller","year":"1991","unstructured":"M\u00fcller, R., Wagner, D.: \u03b1-vertex separator is NP-hard even for 3-regular graphs. J. Computing\u00a046, 343\u2013353 (1991)","journal-title":"J. Computing"},{"key":"2_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-61142-8_588","volume-title":"High-Performance Computing and Networking","author":"F. Pellegrini","year":"1996","unstructured":"Pellegrini, F., Roman, J.: SCOTCH: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P.M.A. (eds.) HPCN-Europe 1996. LNCS, vol.\u00a01067, pp. 493\u2013498. Springer, Heidelberg (1996)"},{"key":"2_CR45","unstructured":"Preis, R., Diekmann, R.: The PARTY partitioning-library, user guide - version 1.1. Tech. Rep. tr-rsfb-96-024, University of Paderborn (1996)"},{"key":"2_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-89754-5_1","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"D. Priemuth-Schmid","year":"2008","unstructured":"Priemuth-Schmid, D., Biryukov, A.: Slid pairs in Salsa20 and Trivium. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol.\u00a05365, pp. 1\u201314. Springer, Heidelberg (2008)"},{"key":"2_CR47","unstructured":"Raddum, H., Semaev, I.: New technique for solving sparse equation systems. Cryptology ePrint Archive, Report 2006\/475 (2006), http:\/\/eprint.iacr.org\/2006\/475"},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Raddum, H.: Cryptanalytic results on Trivium. Tech. Rep. 2006\/039, The eSTREAM Project (March 27, 2006), http:\/\/www.ecrypt.eu.org\/stream\/papersdir\/2006\/039.ps","DOI":"10.1088\/1126-6708\/2006\/08\/039"},{"key":"2_CR49","first-page":"57","volume-title":"9th workshop on Design automation","author":"D.G. Schweikert","year":"1972","unstructured":"Schweikert, D.G., Kernighan, B.W.: A proper model for the partitioning of electrical circuits. In: 9th workshop on Design automation, pp. 57\u201392. ACM, New York (1972)"},{"key":"2_CR50","unstructured":"Vielhaber, M.: Breaking One. Fivium by AIDA an algebraic IV differential attack. Cryptology ePrint Archive, Report 2007\/413 (2007), http:\/\/eprint.iacr.org\/2007\/413"},{"key":"2_CR51","unstructured":"Walshaw, C., Cross, M.: JOSTLE: Parallel Multilevel Graph-Partitioning Software - An Overview. Tech. rep., Civil-Comp Ltd. (2007)"},{"key":"2_CR52","unstructured":"Wong, K.K.H.: Application of Finite Field Computation to Cryptology: Extension Field Arithmetic in Public Key Systems and Algebraic Attacks on Stream Ciphers. PhD Thesis, Information Security Institute, Queensland University of Technology (2008)"},{"key":"2_CR53","unstructured":"Wong, K.K.H., Bard, G., Lewis, R.: Partitioning multivariate polynomial equations via vertex separators for algebraic cryptanalysis and mathematical applications. Draft Article (2008), http:\/\/www.math.umd.edu\/~bardg\/publications.html"},{"key":"2_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11941378_4","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"K.K.H. Wong","year":"2006","unstructured":"Wong, K.K.H., Colbert, B., Batten, L., Al-Hinai, S.: Algebraic attacks on clock-controlled cascade ciphers. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 32\u201347. Springer, Heidelberg (2006)"},{"key":"2_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-74619-5_19","volume-title":"Fast Software Encryption","author":"B.Y. Yang","year":"2007","unstructured":"Yang, B.Y., Chen, O.C.H., Bernstein, D.J., Chen, J.M.: Analysis of QUAD. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol.\u00a04593, pp. 290\u2013308. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14081-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T16:11:00Z","timestamp":1636560660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14081-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140808","9783642140815"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14081-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}